A practical C++23 talk on compile-time perfect hashing for ultra-fast string lookups. Learn how a single-header approach reaches 1B+ queries/second, beats common hash-table baselines, and reduces tail latency in real hot-path parsers and routers.
A practical C++23 talk on compile-time perfect hashing for ultra-fast string lookups. Learn how a single-header approach reaches 1B+ queries/second, beats common hash-table baselines, and reduces tail latency in real hot-path parsers and routers.
Daniel Lemire is a full professor of computer science at the Université du Québec (TELUQ) in Montreal. He specializes in software performance, SIMD vectorization, data indexing, parsing, and high-speed data engineering. He ranks among the top 2% of scientists worldwide by citations (Stanford/Elsevier 2025 ranking) and is one of GitHub’s top 1,000 most-followed developers. His open-source contributions have been widely adopted by major systems, including: simdjson — the pioneering JSON parser reaching gigabytes per second; simdutf — ultra-fast Unicode and base64 processing; fast_float — high-speed number parsing (adopted in Rust, Go, .NET, C++ stdlib, and more); Roaring Bitmaps — used in Elasticsearch, Apache Spark, Druid, Netflix, Uber, and many others; Ada — one of the world’s fastest URL parsers (integrated in Node.js, Cloudflare, and beyond). He has published over 100 peer-reviewed papers and serves as an editor of Software: Practice and Experience (Wiley, founded in 1971).
I’m a Compiler Engineer at Microsoft, working specifically on the Triton to MAIA compiler, and an enthusiast of fast software. My interests include compilers, algorithms, C++, reflection, efficient data structures, low latency, optimization, LLM inference, profiling, performance, and game theory. I’ve also contributed to several open-source projects, including simdjson, mirror_bridge, and karger-klein-tarjan.
