Ron Rothblum (@ronrothblum) 's Twitter Profile
Ron Rothblum

@ronrothblum

ID: 1434950540664913925

calendar_today06-09-2021 18:44:23

126 Tweet

1,1K Takipçi

301 Takip Edilen

Nico (@nico_mnbl) 's Twitter Profile Photo

My current understanding of the Ligerito-WHIR comparison, thread and blogpost. Similarities: recursive structure + sumcheck Differences: WHIR is for RS codes, Ligerito is for arbitrary codes and uses code-switching Consequences: Ligerito can have a linear-time prover, however

My current understanding of the Ligerito-WHIR comparison, thread and blogpost.

Similarities: recursive structure + sumcheck

Differences: WHIR is for RS codes, Ligerito is for arbitrary codes and uses code-switching

Consequences: Ligerito can have a linear-time prover, however
Ron Rothblum (@ronrothblum) 's Twitter Profile Photo

Very proud of the team for our new multilinear proof-system: SP1 hypercube. Let me also take the opportunity to give a huge shoutout to the research community that created many of the underlying building blocks that we use. It really boils down to thirty+ years of theoretical

tcoratger (@tcoratger) 's Twitter Profile Photo

1/ New zkSNARK tech drop: Jagged PCS by Succinct How do you commit to many sparse trace tables, but still prove everything with one polynomial? Meet Jagged PCS — a PCS designed for zkVMs that slashes verifier overhead without compromising structure. 🧵

chris (@0xpangea) 's Twitter Profile Photo

ICYMI: Succinct is actively proving new Ethereum blocks in <12 seconds. 🎉 We just launched a stunning dashboard to visualize proof generation in realtime:

guille (@guilleangeris) 's Twitter Profile Photo

Kobi Gurkan Ron Rothblum similar observations (though applied to the committed matrix, rather than the code matrix) were used to construct Succinct's super-cool jagged PCS it's all weirdly related :) github.com/succinctlabs/h…

Quanta Magazine (@quantamagazine) 's Twitter Profile Photo

An attack on a fundamental proof technique reveals a glaring security issue for blockchains and other digital encryption schemes. Erica Klarreich reports: quantamagazine.org/computer-scien…

An attack on a fundamental proof technique reveals a glaring security issue for blockchains and other digital encryption schemes. Erica Klarreich reports: quantamagazine.org/computer-scien…
alin.apt (@alinush407) 's Twitter Profile Photo

TIL from Ron Rothblum that you can compute all n Lagrange eq(x, i)'s in n + ~\log_2{n} field multiplications (and an inversion) as opposed to 2n👇

TIL from <a href="/ronrothblum/">Ron Rothblum</a> that you can compute all n Lagrange eq(x, i)'s in n + ~\log_2{n} field multiplications (and an inversion) as opposed to 2n👇
Giacomo Fenzi (@giacomofenzi) 's Twitter Profile Photo

Dan Boneh: “Two significant events happened in 2025: one of them is AI getting gold at the IMO, the other is that we are now able to prove Ethereum blocks in 12s, both happened much faster than what I would have thought” Bullish on Succinct 🔥🔥🔥

<a href="/danboneh/">Dan Boneh</a>: “Two significant events happened in 2025: one of them is AI getting gold at the IMO, the other is that we are now able to prove Ethereum blocks in 12s, both happened much faster than what I would have thought”

Bullish on <a href="/SuccinctLabs/">Succinct</a> 🔥🔥🔥