Josh Weinstein jweinst1

🎯

Focusing

On a mission to write the fastest software in the world - 中文名字：马龙

jweinst1 / string_breaker.cpp

Created February 27, 2026 23:39

break strings by regions C++

	#include <iostream>
	#include <string>
	#include <regex>
	#include <vector>
	#include <chrono>
	#include <utility> // For std::pair

	int main() {
	// Generate approximately 10 MB of in-memory text data
	const size_t target_size = 10 * 1024 * 1024; // 10 MB

jweinst1 / multi-hash-graph.cpp

Last active February 22, 2026 10:35

design of multi map hash map for graph db

jweinst1 / hash_byte_arr.cpp

Created February 22, 2026 00:18

C++ hash variable sized byte array

jweinst1 / per_region_quantize.cpp

Last active February 20, 2026 10:02

region specific pattern of quantization for floats

jweinst1 / mean_bit_set.cpp

Created February 16, 2026 21:28

calculates mean via pop count approximation

	struct ConstexprBitset64 {
	uint64_t block = 0;

	constexpr void set(size_t idx) {
	block \|= uint64_t{1} << idx;
	}

	constexpr void clear(size_t idx) {
	block &= ~(uint64_t{1} << idx);
	}

jweinst1 / CMakeLists.txt

Created February 16, 2026 01:03

PyBind11 Example After brew install

	cmake_minimum_required(VERSION 3.14)
	project(kvstore_python LANGUAGES CXX)

	# ----------------------------
	# 1) Find Python
	# ----------------------------
	find_package(Python COMPONENTS Interpreter Development REQUIRED)
	message(STATUS "Python executable: ${Python_EXECUTABLE}")
	message(STATUS "Python include dirs: ${Python_INCLUDE_DIRS}")

jweinst1 / hamming_llm.cpp

Last active February 13, 2026 20:34

Hamming distance based LLM without need for training

	#include <iostream>
	#include <vector>
	#include <string>
	#include <random>
	#include <unordered_map>
	#include <arm_neon.h> // Specialized for your M2 chip

	// 1024-bit vector = 128 bytes = 2 Cache Lines
	// We use alignas(64) to ensure the CPU doesn't cross cache line boundaries
	struct alignas(64) HyperVector {

jweinst1 / slower_page_part_hash_insert.cpp

Created January 25, 2026 01:02

slower page partitioned hash insert.

	static inline bool insertToSpecPage(uint32_t* page, uint32_t hash, const size_t mask) {
	size_t spot_i = hash & mask;
	for (int i = 0; i <= mask; ++i)
	{
	if (page[i] == 0) {
	page[i] = hash;
	return true;
	}
	spot_i = (spot_i + 1) & mask;
	}

jweinst1 / basic_probe_map.cpp

Created January 23, 2026 22:01

Basic probing map in C++

jweinst1 / mmap_write_perf_tlb_Test.cpp

Last active January 23, 2026 01:15

Shows performance of TLB mmap writes across 1, 100, and 1024 pages