Hadas Zeilberger Profile
Hadas Zeilberger

@idocryptography

Followers
376
Following
859
Media
0
Statuses
89

Cryptography PhD student @YaleACL, https://t.co/PTQFUs4The bluesky: @hadaszeilberger.bsky.social

New Haven, Conneticut
Joined March 2022
Don't wanna be here? Send us removal request.
@idocryptography
Hadas Zeilberger
8 months
Very excited to introduce Khatam (eprint 2024/1843): a new Proximity Gaps result for Multilinear Polynomial Commitment Schemes. Not only does it reduce the size of Basefold (including over Random Foldable Codes), but it also improves Blaze, WHIR, Ligero, and others. 🧵(1/x).
2
12
66
@idocryptography
Hadas Zeilberger
18 days
RT @ChrisVanHollen: Don’t look away. Since the start of the Israel-Iran war 7 days ago, over 400 Palestinians in Gaza have been killed, man….
0
8K
0
@idocryptography
Hadas Zeilberger
2 months
RT @zeroknowledgefm: @idocryptography presents Blaze at zkSummit - a new multilinear polynomial commitment scheme (MLPCS) for binary fields….
0
2
0
@idocryptography
Hadas Zeilberger
3 months
RT @KatAbughazaleh: We only get results if we fight and take action. Thank you, Senator Van Hollen. Now it’s time to bring Kilmar home.
0
430
0
@idocryptography
Hadas Zeilberger
4 months
RT @FoxBrambleFarm: So many people still don't realize how many protests are erupting across the country. The sheer number of them should b….
0
16K
0
@idocryptography
Hadas Zeilberger
4 months
RT @RepJerryNadler: I am monitoring the situation regarding the arrest of Mahmoud Khalil and look forward to receiving additional informati….
0
646
0
@idocryptography
Hadas Zeilberger
5 months
This exactly matches the proof size of FRI for small fields, is ~25% improvement over the previous Khatam results and a ~50% improvement over the original BaseFold result. If using large fields or proof-of-work, BaseFold over RS codes matches FRI using (2024/1571) cc @UHaboeck.
0
0
2
@idocryptography
Hadas Zeilberger
5 months
- When you are using codes that are not Reed-Solomon.- If you don't want to use proof-of-work but you still want to use small fields (e.g. 128-bit field). Alternatives only allow ~190bit fields or proof-of-work, which lengthens prover time.
1
0
5
@idocryptography
Hadas Zeilberger
5 months
Presenting a new improved Khatam result showing BaseFold secure within one-and-a-half Johnson bound! ( with very small error probability < 2/eps^{2}|\FF}, which significantly improves recent work (2024/1810). Concretely, when to use these results? 🧵.
@idocryptography
Hadas Zeilberger
8 months
Very excited to introduce Khatam (eprint 2024/1843): a new Proximity Gaps result for Multilinear Polynomial Commitment Schemes. Not only does it reduce the size of Basefold (including over Random Foldable Codes), but it also improves Blaze, WHIR, Ligero, and others. 🧵(1/x).
1
11
48
@idocryptography
Hadas Zeilberger
5 months
RT @Charles_Chen533: Excited by LatticeFold+(, a joint work with @danboneh for constructing post-quantum secure and….
0
39
0
@idocryptography
Hadas Zeilberger
5 months
RT @benafisch: Blaze will be in Eurocrypt 2025 šŸ‡ŖšŸ‡ø. Blaze is a multilinear polynomial commitment with ultra-efficient proving over binary fi….
0
6
0
@idocryptography
Hadas Zeilberger
5 months
RT @Dan_Jeffries1: As we are learning DeepSeek is one of the most sophisticated psyops of all time. Here's how it went down:. 1) Release….
0
1K
0
@idocryptography
Hadas Zeilberger
7 months
RT @TheBealDeal: Excited to share Mira, a new folding scheme for pairing-based arguments. Mira enables efficient proof aggregation for Grot….
0
20
0
@idocryptography
Hadas Zeilberger
8 months
Jokes aside - I feel lucky to be apart of such a talented community of researchers, and this experience has taught me a valuable lesson in trusting the process of research. (end).
0
0
2
@idocryptography
Hadas Zeilberger
8 months
This thread is dedicated to the SBC reviewer who rejected Basefold because they were "skeptical this technique will ever be useful due to its proof size" :) (6/x).
2
2
9
@idocryptography
Hadas Zeilberger
8 months
Now Basefold matches FRI proof size in nearly all settings. One is still missing - the 1.5 Johnson Bound, but at this point, I think it's a matter of weeks, and other concurrent work (2024/1810) has potentially already made a lot of progress towards that. (5/x).
1
0
2
@idocryptography
Hadas Zeilberger
8 months
that Basefold over RS codes matches the best results of FRI.2) @YanpeiGuo et. al. publishes a paper showing that Deep-FRI can be applied to Basefold over RS codes, another setting where Basefold matches FRI. Nov '24: Khatam published (4/x).
1
0
3
@idocryptography
Hadas Zeilberger
8 months
Nov '23: Basefold published, a field-agnostic Multilinear PCS with identical performance to univariate PCS (enabling more efficient SNARKs) with one caveat: It's proof size was still a few times larger than FRI.Oct '24: 1) @UHaboeck publishes a result showing (3/x).
1
0
2
@idocryptography
Hadas Zeilberger
8 months
Currently, the write-up presents the new proof - Soon, it will also contain the concrete improvements to various multilinear PCS. There has been a flurry of activity surrounding Basefold + Proximity Gaps lately so here's a timeline to summarize: (2/x).
1
0
2
@idocryptography
Hadas Zeilberger
9 months
RT @fermatslibrary: 2Ā¹Ā³ā¶Ā²ā·ā¹āøā“Ā¹āˆ’1, discovered today, is the largest known prime. It's a Mersenne prime (2įµ–-1), which are easier to find. It….
0
5K
0