
Hadas Zeilberger
@idocryptography
Followers
376
Following
858
Media
0
Statuses
89
Cryptography PhD student @YaleACL, https://t.co/PTQFUs4The bluesky: @hadaszeilberger.bsky.social
New Haven, Conneticut
Joined March 2022
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
RT @zeroknowledgefm: @idocryptography presents Blaze at zkSummit - a new multilinear polynomial commitment scheme (MLPCS) for binary fieldsā¦.
0
2
0
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
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
RT @RepJerryNadler: I am monitoring the situation regarding the arrest of Mahmoud Khalil and look forward to receiving additional informatiā¦.
0
646
0
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
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? š§µ.
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
RT @Charles_Chen533: Excited by LatticeFold+(, a joint work with @danboneh for constructing post-quantum secure andā¦.
0
39
0
RT @benafisch: Blaze will be in Eurocrypt 2025 šŖšø. Blaze is a multilinear polynomial commitment with ultra-efficient proving over binary fiā¦.
0
6
0
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
RT @TheBealDeal: Excited to share Mira, a new folding scheme for pairing-based arguments. Mira enables efficient proof aggregation for Grotā¦.
0
20
0
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
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
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