peavey2787/qssm-rs

QSSM, short for Quantum-Safe Sovereign Multiset, is a cryptographic system for generating and checking zero-knowledge proofs, meaning it lets someone prove a statement is true without revealing the private data behind it. It is designed to be post-quantum, built on lattice-based mathematics that is expected to resist attacks from quantum computers, and stateless, so a verifier does not need to replay any history or trust a shared ledger to check a proof. The project is built around two proving engines behind one shared interface. Engine A uses a lattice-based method with prover randomness and statistical proofs, while Engine B is a deterministic, hash-based engine with no randomness involved. Both aim for fast local proof generation, with a stated performance target of under 10 milliseconds, and neither requires a network of external provers, GPU farms, or any blockchain. The project's security claims have been checked with a formal verification tool called EasyCrypt, covering 149 theories with no unproven assumptions. QSSM is distributed three ways depending on how you want to use it. There is a set of Rust crates for embedding the proving system directly into a Rust application, a standalone command line tool for proving and verifying files locally, and a WebAssembly package for use in a browser, Node.js, or TypeScript project. The README describes the target users as developers building local proof and verify flows, researchers studying post-quantum proving systems, and auditors reviewing the underlying cryptography. The project explicitly states what it is not: not a virtual machine for zero-knowledge circuits, not a blockchain, not a prover network, and not a layer-2 scaling system. It is licensed under the Business Source License 1.1 and is aimed at technical users comfortable with cryptography rather than general application developers. The full README is longer than what was shown.