Quantum Algorithm Invalidates Post-Quantum SNARK Security Assumptions, Forcing Re-Evaluation
A quantum polynomial-time sampler breaks the hardness assumption for lattice-based SNARKs, demanding new post-quantum security proofs.
