Search papers, labs, and topics across Lattice.
Affiliation:
2
0
1
Validators no longer need to maintain massive state trees on the critical consensus path to support trustless inclusion proofs: off-chain recursive SNARKs can maintain a billion-leaf state with only 2–4 seconds of latency.
A new algebraic algorithm for Search-LWE achieves polynomial complexity improvements, challenging previous assumptions in cryptographic problem-solving.
