bbtree: LLM-written Rust ordered map, author reports 5x faster than std BTreeMap
Why it matters
Xiangpeng Hao published bbtree (blog post, Oct 23, 2026), a Rust ordered map whose implementation is written entirely by LLMs: "All of the implementation is written by LLMs, and cross-checked by LLMs from different providers." He steers every design decision and says he is accountable for the code. On his own benchmarks, bbtree is 5x faster than Rust's std BTreeMap on a single thread and 12x faster than crossbeam-skiplist at 96 threads, with 30% lower memory usage. Correctness is guarded by fuzzing against std's BTreeMap, Verus formal verification of critical properties, and deterministic simulation testing with Shuttle, all run in CI. These are the author's own benchmarks, not independent tests.
Read the source: Xiangpeng Hao (blog + GitHub) (opens in a new tab)
All hits from 25 Oct 2026More CodingGet the daily hits by email