recursive brakedown.md

recursive Brakedown: the perfect lens the gap Brakedown is the best transparent, post-quantum, Merkle-free lens. O(N) commit. O(√N) proof. zero hash trees. but FRI/WHIR have O(log² N) proofs — smaller for large N. the question: can we get O(log N) proof size while keeping O(N) commit, Merkle-free,…