zkVMs about to get faster, freshly cooked by Georg
I recently went through the exercise of applying logup* (Soukhanov) to implement Twist and Shout (Setty & Thaler). As a result, we can have memory checking arguments with very cheap commitment costs using hash-based commitment schemes! ↓

Nov 2, 2025 · 5:28 PM UTC

2
9
71
Replying to @leonardoalt
I am still sus - there is full n log(m) worth of sparse sumcheck with m being size of your ram.
3
4
Yea but at least for registers it should still be a significant improvement
1
3
We asked leading AI models to simulate oncologist poll responses for a 2L treatment scenario in combined hepatocellular-cholangiocarcinoma (HCC-CCA) and then compared it to the original post by Dr. Erman Akkus.
1