P vs NP vs PSPACE: Understanding Computational Complexity
A walkthrough of P, NP, and PSPACE, how they relate, and why the idea of a witness connects NP problems to zero-knowledge proofs.
complexity theoryzero-knowledge proofs
latest — Oct 08, 2026
Losing Pieces, Keeping the Whole: Reed-Solomon Codes
How Reed-Solomon codes let a scratched CD keep playing, from polynomials and parity to the shuffle that makes burst errors easy to fix.
more dispatches