Researchwait freememory reclamationrustformal verification
Kovan Implements Wait-Free Reclamation For Rust
6.7
The author of Lever announces Kovan, a Rust implementation of the Crystalline wait-free memory-reclamation algorithm and an associated wait-free data-structure ecosystem. They report production experience (Lever processed over 25 million operations in under two seconds), M-series Mac benchmarks showing 1.3–1.4× read-heavy performance versus crossbeam-epoch, and TLA+ verification guaranteeing wait-free progress and bounded memory.
Key Points
- 1Implements wait-free memory reclamation (Kovan) based on Crystalline with bounded-memory guarantees
- 2Demonstrates practical benefit: 1.3–1.4× faster read-heavy performance than crossbeam-epoch in benchmarks
- 3Enables latency-sensitive Rust systems to avoid epoch stalls and unbounded heap growth in production
Scoring Rationale
Strong practical implementation and TLA+ verification with clear benchmarks; limited scope to Rust/systems and single-author release.
Sources
Public references used for this report.
Practice interview problems based on real data
1,625 SQL & Python problems across 15 industry datasets — the exact type of data you work with.
Try 250 free problems
