Just published a simpler proof of the RBR soundness of FRI! Work with @0xAlbertG and Benedikt Wagner I also wrote a blog post explaining the high level ideas of the proof. All you need to know is how to colour a graph! Links to paper and blog below 1/3

ePrint: blog: This analysis came up because we needed stronger properties for FRI in some separate work. That work is a bit on the back-burner but the recent EF PQ workshop in Cambridge motivated us to release 2/3

a standalone FRI proof. Turns out it can be helpful for the formal verification of the whole SNARK stack! Now the big question is: who will prove MCA up to the capacity bound? 3/3