{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:26Z","timestamp":1781031446694,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800827","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1157-1167","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On Proximity Gaps of Reed-Solomon Codes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0708-0483","authenticated-orcid":false,"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[{"name":"StarkWare Industries, Netanya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9952-5947","authenticated-orcid":false,"given":"Dan","family":"Carmon","sequence":"additional","affiliation":[{"name":"StarkWare Industries, Netanya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-9260","authenticated-orcid":false,"given":"Ulrich","family":"Hab\u00f6ck","sequence":"additional","affiliation":[{"name":"StarkWare Industries, Netanya, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2704-8808","authenticated-orcid":false,"given":"Swastik","family":"Kopparty","sequence":"additional","affiliation":[{"name":"University of Toronto, Department of Mathematics, Department of Computer Science, Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0874-2978","authenticated-orcid":false,"given":"Shubhangi","family":"Saraf","sequence":"additional","affiliation":[{"name":"University of Toronto, Department of Mathematics, Department of Computer Science, Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00050"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_1_9_1","unstructured":"Eli Ben-Sasson. 2021. ethSTARK Documentation. Cryptology ePrint Archive Paper 2021\/582. https:\/\/eprint.iacr.org\/2021\/582"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"e_1_3_2_1_11_1","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. Cryptology ePrint Archive Paper 2018\/046. https:\/\/eprint.iacr.org\/2018\/046"},{"key":"e_1_3_2_1_12_1","unstructured":"Eli Ben-Sasson Dan Carmon Ulrich Hab\u00f6ck Swastik Kopparty and Shubhangi Saraf. 2025. On Proximity Gaps for Reed\u2013Solomon Codes (Full Version). Cryptology ePrint Archive Paper 2025\/2055. https:\/\/eprint.iacr.org\/2025\/2055"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3614423"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.73"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3235586.3235610"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"e_1_3_2_1_19_1","unstructured":"Dan Carmon Lior Goldberg Ulrich Hab\u00f6ck Leonardo Lerer Ilya Lesokhin Shahar Papini and Shahar Samocha. 2026. S-two Whitepaper. Cryptology ePrint Archive Paper 2026\/532. https:\/\/eprint.iacr.org\/2026\/532"},{"key":"e_1_3_2_1_20_1","unstructured":"Elizabeth Crites and Alistair Stewart. 2025. On Reed\u2013Solomon Proximity Gaps Conjectures. Cryptology ePrint Archive Paper 2025\/2046. https:\/\/eprint.iacr.org\/2025\/2046"},{"key":"e_1_3_2_1_21_1","volume-title":"Diamond and Angus Gruen","author":"Benjamin","year":"2025","unstructured":"Benjamin E. Diamond and Angus Gruen. 2025. On the Distribution of the Distances of Random Words. Cryptology ePrint Archive, Paper 2025\/2010. https:\/\/eprint.iacr.org\/2025\/2010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.62056\/a0ljbkrz"},{"key":"e_1_3_2_1_23_1","volume-title":"Diamond and Jim Posen","author":"Benjamin","year":"2024","unstructured":"Benjamin E. Diamond and Jim Posen. 2024. Polylogarithmic Proofs for Multilinears over Binary Towers. Cryptology ePrint Archive, Paper 2024\/504. https:\/\/eprint.iacr.org\/2024\/504"},{"key":"e_1_3_2_1_24_1","first-page":"94","article-title":"List Decoding for Noisy Channels. Research Laboratory of Electronics, Massachusetts Institute of Technology. Reprinted from the 1957 IRE WESCON Convention Record","volume":"2","author":"Elias Peter","year":"1957","unstructured":"Peter Elias. 1957. List Decoding for Noisy Channels. Research Laboratory of Electronics, Massachusetts Institute of Technology. Reprinted from the 1957 IRE WESCON Convention Record, Part 2, pp. 94\u2013104","journal-title":"Part"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1988.5275"},{"key":"e_1_3_2_1_26_1","unstructured":"Ethereum Foundation. 2025. The Proximity Price. https:\/\/proximityprize.org\/"},{"key":"e_1_3_2_1_27_1","unstructured":"Yiwen Gao Dongliang Cai Yang Xu and Haibin Kan. 2025. From List-Decodability to Proximity Gaps. Cryptology ePrint Archive Paper 2025\/870. https:\/\/eprint.iacr.org\/2025\/870"},{"key":"e_1_3_2_1_28_1","unstructured":"Yiwen Gao Haibin Kan and Yuan Li. 2024. Linear Proximity Gap for Linear Codes within the 1.5 Johnson Bound. Cryptology ePrint Archive Paper 2024\/1810. https:\/\/eprint.iacr.org\/2024\/1810"},{"key":"e_1_3_2_1_29_1","unstructured":"Albert Garreta Angus Gruen and Igancio Manzur. 2025. Attacking FRI and the STARK toy problem. (Personal communication)"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"A. A. Glibichuk and S. V. Konyagin. 2007. Additive properties of product sets in fields of prime order. arxiv:math\/0702729. arxiv:math\/0702729","DOI":"10.1090\/crmp\/043\/15"},{"key":"e_1_3_2_1_31_1","unstructured":"Rohan Goyal and Venkatesan Guruswami. 2025. Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed\u2013Solomon Codes. Cryptology ePrint Archive Paper 2025\/2054. https:\/\/eprint.iacr.org\/2025\/2054"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1463707"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"e_1_3_2_1_35_1","unstructured":"Ulrich Hab\u00f6ck. 2024. Basefold in the List Decoding Regime. Cryptology ePrint Archive Paper 2024\/1571. https:\/\/eprint.iacr.org\/2024\/1571"},{"key":"e_1_3_2_1_36_1","unstructured":"Ulrich Hab\u00f6ck. 2025. A note on mutual correlated agreement for Reed\u2013Solomon codes. Cryptology ePrint Archive Paper 2025\/2110. https:\/\/eprint.iacr.org\/2025\/2110"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.923744"},{"key":"e_1_3_2_1_39_1","unstructured":"Dmitry Krachun and Stepan Kazanin. December 2025. Failure of the proximity gap conjecture for Reed\u2013Solomon code close to the capacity regime. In communication with the Ethereum Foundation."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525926"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00067"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897652"},{"key":"e_1_3_2_1_43_1","unstructured":"Ron Roth and Gilles Z\u00e9mor. 2018. Personal communcation to the authors of Ligero. Cited in the full version of Ligero https:\/\/eprint.iacr.org\/2022\/1608"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488709"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"e_1_3_2_1_47_1","volume-title":"Berlekamp","author":"Welch Lloyd R.","year":"1983","unstructured":"Lloyd R. Welch and Elwyn R. Berlekamp. 1983. Error Correction for Algebraic Block Codes. US Patent 4633470. filed Sep. 27, 1983, issued Dec. 30, 1986"},{"key":"e_1_3_2_1_48_1","first-page":"90","article-title":"List Decoding. Quarterly Progress Report, Research Laboratory of Electronics","volume":"48","author":"Wozencraft John M.","year":"1958","unstructured":"John M. Wozencraft. 1958. List Decoding. Quarterly Progress Report, Research Laboratory of Electronics, MIT, 48 (1958), 90\u201395.","journal-title":"MIT"},{"key":"e_1_3_2_1_49_1","volume-title":"Khatam: Reducing the Communication Complexity of Code-Based SNARKs. Cryptology ePrint Archive, Paper 2024\/1843. https:\/\/eprint.iacr.org\/2024\/1843","author":"Zeilberger Hadas","year":"2024","unstructured":"Hadas Zeilberger. 2024. Khatam: Reducing the Communication Complexity of Code-Based SNARKs. Cryptology ePrint Archive, Paper 2024\/1843. https:\/\/eprint.iacr.org\/2024\/1843"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_5"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:03:39Z","timestamp":1781028219000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":50,"alternative-id":["10.1145\/3798129.3800827","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800827","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}