World record fastest exact subset sum solver. Breakthrough discovery -- solves NP-complete subset sum problem up to n=70 with 1 quadrillion values. Open source.
python rust open-source cryptography algorithm parallel-computing backtracking np-hard np-complete high-performance-computing search-algorithm dynamic-programming meet-in-the-middle integer-programming branch-and-bound combinatorial-optimization subset-sum subset-sum-solver world-record sum-range-partitioning
-
Updated
Aug 12, 2026 - Rust