bbtree claims fastest concurrent btree: 5x faster than std BTreeMap single-threaded

tianyin_xu · x · 2026-10-25

Developer Xiangpeng Hao open-sourced bbtree, a concurrent ordered map (btree) he claims is the fastest available.

Key numbers:

• 5x faster than Rust std's BTreeMap single-threaded; 12x faster than crossbeam-skiplist at 96 threads
• 30% lower memory usage and 5x lower p99 latency
• Zero dependencies, nostd compatible; unsync::BBTreeMap is a drop-in replacement for std's BTreeMap/BTreeSet
• Production-readiness backed by formal verification, model checking, deterministic simulation, and fuzzing

Code is on GitHub (72 stars), with a technical blog post and live demo explaining the design.

Original post →

More from Research

• AI for systems research: basic agent swarms plus good metrics get ideas shipped — sh_reya · 2026-10-25
• 1,000+ mathematicians form Association for Human Mathematics, pledge not to publish AI-generated papers — Hesamation · 2026-10-25
• CritPt, SciCode and Terminal-Bench Science: three science benchmarks as RL environments — geoffwolfe · 2026-10-25
• Robotics researcher: 2 days is enough to ship a follow-up paper on supermimic — ChongZzZhang · 2026-10-25
• EMNLP paper introduces Concept-Targeted Attribution, tracing the circuits behind linear probes — ZhijingJin · 2026-10-25
• Covert channel math: 128-bit secret leaks in 13s, 1TB weights take centuries — vishalmisra · 2026-10-25

Research channel →