How I Made G6K’s Spherical Code Generator 100× Faster
G6K’s SimHash filter depends on sparse spherical codes generated by a Python hill-climber that takes minutes per dimension. Rewriting it in Rust around one observation — a coordinate swap only modifies one row of the Gram matrix — turns that into seconds, with byte-identical output files.
RustLattice SievingPerformance