STARKs, FRI, and the transparent dream
Why hash-based proofs matter, how FRI low-degree testing works in the large, and where STARKs beat SNARKs on throughput despite the proof size penalty.
FROM THE BROADCAST
"Good evening. Tonight we cover starks: post-quantum and transparent. This is the kind of topic that sits right on the seam between research and production, and we're going to walk through the construction before looking at what it means for the chains that actually ship it."
"The short version is this: STARKs throw out pairings in favor of hash functions and polynomial low-degree testing. We'll spend the first half of the segment on the core mechanism, and the second half on what operators are actually deploying."
"Let's start with the basics. The transparent setup is the first selling point: no ceremony, no toxic waste, nothing to trust beyond collision-resistant hashing. The second is plausible post-quantum security, since Shor does not break Merkle trees. Keep that in mind as we go deeper."
STARKs: post-quantum and transparent
STARKs throw out pairings in favor of hash functions and polynomial low-degree testing. The transparent setup is the first selling point: no ceremony, no toxic waste, nothing to trust beyond collision-resistant hashing.
OPEN TOPIC ->SOURCE MATERIAL
