Guo Yu

1.5K posts

Guo Yu

Guo Yu

@1dot2

Crypto Maximalist, EVM/cryptography/system/reading/fun, Proud Founder of @SECBIT_IO

Suzhou, China Katılım Şubat 2010
1.7K Takip Edilen2.3K Takipçiler
Guo Yu retweetledi
ulrich.haboeck
ulrich.haboeck@UHaboeck·
Sitting on the shoulders of giants, I am glad to announce the following paper with Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, and Shubhangi Saraf: eccc.weizmann.ac.il/report/2025/16… On the one hand, we improve the existing decoder analysis from Ben-Sasson, Carmon, Ishai, Kopparty and Saraf (BCIKS 2020), reducing it to an O(n) soundness error for correlated agreement up to the Johnson radius. In practice, it shows that degree 4 extensions of a 31 bit prime field (like M31, Babybear or Koalabear) are sufficient for FRI up to that radius, in many applications, considering that you are willing to grind. On the other hand, we provide additional counter examples that question the proximity gaps conjecture as written. Notably, over binary fields one cannot expect an O(n) error already *at* Johnson radius, rather a quadratic one. In general, proximity gaps stop at the distance where we have more than field size many proximates, meaning that we have to respect small gap to capacity. (See also the recent work of Crites and Stewart, as well as Diamond and Gruen.)
English
11
24
91
9.9K
Guo Yu retweetledi
Ben Diamond
Ben Diamond@benediamond·
@Arvolear correction: it's 3% larger 𝘢𝘵 𝘣𝘦𝘴𝘵, not at worst. it could be up to 2x larger.
English
1
2
12
726
Guo Yu retweetledi
Georg Wiese
Georg Wiese@georgwiese·
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! ↓
Georg Wiese tweet media
English
5
21
92
20.7K
Guo Yu retweetledi
Angus Gruen
Angus Gruen@AngusGruen·
An exciting update from myself and @benediamond (eprint.iacr.org/2025/2010). We show that the 𝘶𝘱-𝘵𝘰-𝘤𝘢𝘱𝘢𝘤𝘪𝘵𝘺 proximity gaps conjecture is 𝗳𝗮𝗹𝘀𝗲. More precisely, given any pair c, d we construct codes whose error grows faster than nᶜ / (q ⋅ (ρ η)ᵈ).
English
19
94
485
274.5K
Guo Yu retweetledi
Ariel Gabizon
Ariel Gabizon@rel_zeta_tech·
People talk about the need for standards in snarks. My (biased as an author) opinion is the thing to standardzie is plonk as in the paper. It has been through more scrutiny than any other construction, with several papers, from three separate research groups, proving the security of the exact construction in the paper. Latest one being: eprint.iacr.org/2025/1759
English
5
2
26
3.2K
Guo Yu retweetledi
ETHTAO
ETHTAO@Ethtao_Ethtao·
🔥 Ethereum on Tour is landing at Shanghai Jiao Tong University & East China Normal University! 🇨🇳 Don't miss this chance to explore the future of cryptography and blockchain with top academic minds! 🧠 🎙️ Featuring: · EF Co-Executive Director Tomasz @tkstanczak with exclusive insights on the latest Ethereum research. · Leading scholars from SJTU & ECNU covering NIST PQ Crypto, ZK, zkTLS, FHE, and more! 🗓️ Date: Oct 24th 📍 Venue: SJTU 🔗 RSVP NOW: luma.com/iqf3t4hn Organized by @ethereumfndn Academic Secretariat, @sjtu1896, @ECNUER. Supported by @SNZholding & @ETHTAO. Big thanks for our partners: @OpenBuildxyz, @GCCofCommons, @panews, @ForesightNewsEN, @OdailyChina.
ETHTAO tweet media
English
2
8
36
4.5K
Guo Yu retweetledi
ETHTAO
ETHTAO@Ethtao_Ethtao·
📢【Ethereum on Tour:以太坊基金会高校行】将走进上海交大和华东师大! 🔥不要错过与顶尖学者们一起探索密码学和区块链未来的机会! 🎙️活动亮点: · 以太坊基金会联合执行董事 Tomasz @tkstanczak独家分享以太坊最前沿研究。 · 来自上海交大和华东师大的教授学者们,将分享 NIST抗量子算法、ZK、zkTLS、FHE 等研究成果。 🗓️ 时间:10月24日 📍 地点:上海交通大学 🔗 立即报名:luma.com/iqf3t4hn 这次活动由上海交通大学John Hopcroft计算机科学中心、华东师范大学密码学院、以太坊基金会 @ethereumfndn 和以太坊基金会学术秘书处主办,SNZ Capital @snzholding 、ETHTAO @Ethtao_Ethtao 组织协办。 非常感谢我们合作伙伴的支持:@OpenBuildxyz, @GCCofCommons, @panews, @ForesightNewsEN, @OdailyChina.
ETHTAO tweet media
中文
0
2
6
1.8K
Guo Yu retweetledi
Binyi Chen
Binyi Chen@Charles_Chen533·
Excited to share eprint.iacr.org/2025/1905.pdf, which rethinks the usage of folding in succinct proof systems. We provide a new framework to build folding-based SNARKs, by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme
English
11
28
114
8K
Guo Yu retweetledi
Yupeng Zhang
Yupeng Zhang@YupengZhang7·
Excited to share our new paper: eprint.iacr.org/2025/1897! We made Groth16 dynamic - proofs can now be efficiently updated when the witness changes slightly. Amazing that after 10 years, we still have new insights of Groth16 and Pinocchio. Joint work with two brilliant new students
English
8
27
170
11.2K
Guo Yu retweetledi
Remco
Remco@recmo·
There's an elegantly simple way to embed base-field inner products into an degree d extension field with no memory overhead and only O(d) computation overhead. I finally did a proper write-up. Very keen to try this for M31 in WHIR. Link in reply.
Remco tweet media
English
3
5
53
6.9K
Guo Yu retweetledi
Pratik Sarkar
Pratik Sarkar@pratiks_crypto·
Lattice and FHE broken? In 2024, Yilei Chen claimed that lattice-based cryptography was broken. eprint.iacr.org/2024/555 However, there was a bug in the attack, and the claim did not hold. This new paper by Yifan Zhang claims to fix that error. arxiv.org/pdf/2509.12341 Let's see what the quantum experts say. If this holds, then it can have detrimental effects on the lattice-based post-quantum security efforts. Github link: github.com/yifanzhang-pro…
English
7
22
105
10.2K
Guo Yu retweetledi
ulrich.haboeck
ulrich.haboeck@UHaboeck·
Actually never took notice of Lev Soukhanov's logup* construction. Such a beautiful idea, to keep looked-up columns entirely virtual, and prove their value at the random point by duality, translating the lookup consistency to the Lagrange function (the eq). eprint.iacr.org/2025/946 Long time ago, I played with same duality to prove the shift on the hypercube. But I did not realise how useful it is for lookups!
English
1
4
34
2K
Guo Yu retweetledi
Benny Pinkas
Benny Pinkas@bennypinkas·
In a new blog post at decentralizedthoughts.github.io/2025-02-14-ver…, we present a method for verifying multi-exponentiations and multi-scalar multiplications (MSMs) to facilitate outsourcing these computations. This allows the prover to perform the computation typically done by the verifier.
English
4
12
75
19.3K
Guo Yu retweetledi
Tom Gur
Tom Gur@TomGur·
I've enjoyed this excellent exposition of the recent progress in the combinatorial list-size bounds of Folded Reed Solomon codes and multiplicity codes by Garg, @prahladh , Kumar, Saptharishi, and Shankar. A fascinating read. arxiv.org/pdf/2502.14358…
English
2
2
25
3K
Guo Yu retweetledi
Gal Arnon
Gal Arnon@GalArnon42·
Delighted to share my new paper with Eylon Yogev presenting a new Fiat-Shamir (FS) transformation that aims to be secure against recent white-box attacks: ia.cr/2025/329 The FS transformation is used to convert public-coin interactive protocols to non-interactive ones.
English
3
34
106
22.7K
Guo Yu retweetledi
Giacomo Fenzi
Giacomo Fenzi@GiacomoFenzi·
Amazing new work by @GalArnon42 and Eylon Yogev on how to securely instantiate the Fiat-Shamir transformation and avoid the recent brilliant diagonalization attack of @ronrothblum, @levs57 and @Khovr!
Giacomo Fenzi tweet media
English
1
12
73
5.1K
Guo Yu retweetledi
ulrich.haboeck
ulrich.haboeck@UHaboeck·
Uploaded a revision of the note on adding zk to STARK, eprint.iacr.org/2024/1037. Should be much more readable now, hopefully, and it adds a short discussion on perfect zero-knowledge in permutation arguments.
English
2
23
96
8K
Rute Figueiredo
Rute Figueiredo@rutefig·
Starting a new journey with @zkemail as a devrel 🚀 I couldn't be more excited to work on this amazing project and with such an amazing team 😃
English
40
3
175
7K
Guo Yu retweetledi
Surfer
Surfer@surfer__05·
In addition to this post, I curated this repo : github.com/surfer05/zk-no… I've added a new folder named papers! It contains PDFs where I've jotted down my own understanding and explanations while reading key research papers. I hope it can be helpful in fostering more collaborative understanding of different protocols.
Surfer tweet mediaSurfer tweet media
Surfer@surfer__05

I've had quite a few people ask me how to get started in ZK. I'm by no means any expert, but here's what worked for me, and I still keep adding to it: Part 1: 1. rareskills.io/zk-book: which is the best resource to start as a beginner 2. rb.gy/et58js: I moved on to reading the moon-math manual and solving the exercises. It gets easy if you have already read the Zk-book ⁠3. abstract.ups.edu: For learning Abstract Algebra in detail, I recently added it to my list, and it's great. This gives us enough exposure to zk mathematics, and we move on to deep-diving next, Part 2: 1. zk-learning.org: ZKP-MOOC series is great for understanding various protocols, along with some circuit writing sessions ⁠2. rb.gy/x786jz: Justin Thaler's "Proof, Args, and Zk” is the best book for learning everything from the ground up, and I have thoroughly enjoyed it. 3.rb.gy/ulkrnt: ZK-Whiteboard sessions by the professionals themselves. Once through with the above resources, we should be good enough to read the newly released research papers and advancements. insights.zkpunk.pro and @ZKNewsletter have been my go-to sources for tracking recent updates. Some other resources which I followed include: 1. toc.cryptobook.us: “Graduate Course in Applied Cryptography” by Dan Boneh for understanding cryptography in general (math-heavy, still reading..) ⁠2. Real-world Cryptography by @cryptodavidw, giving us exposure to real-life use cases of cryptography without forcing us to know the exact maths. 3. rb.gy/72sybw: I still have this tweet by @portport255 bookmarked, listing all the books in one place. He is an amazing guide. It’s an ever-evolving field—keep learning and enjoy the journey! I’m still learning too, so let’s grow together. Good luckkk !!!

English
1
1
20
1.8K