typo:fix

Author: ziyinlox-purple

post/weekly-20241124.md

@@ -1,6 +1,6 @@
 ## Highlights
 ### Devcon Key Insight: Indistinguishability Obfuscation
-本文讨论了**不可区分混淆（iO）**这一被称为密码学「圣杯」的技术，它能够在保留程序功能的同时隐藏其逻辑。文章提到 Sora（基于标准假设）和 Gauss Labs（基于非标准假设）在 iO 实现上的最新进展，并探讨了如安全投票和抗串通多方系统等实际应用，同时提及了验证者串通等挑战。尽管 iO 目前效率低下且仍偏理论化，但其在区块链、zkSNARKs 等领域的潜力巨大，相关实践正在逐步推进。
+本文讨论了 **不可区分混淆（iO）** 这一被称为密码学「圣杯」的技术，它能够在保留程序功能的同时隐藏其逻辑。文章提到 Sora（基于标准假设）和 Gauss Labs（基于非标准假设）在 iO 实现上的最新进展，并探讨了如安全投票和抗串通多方系统等实际应用，同时提及了验证者串通等挑战。尽管 iO 目前效率低下且仍偏理论化，但其在区块链、zkSNARKs 等领域的潜力巨大，相关实践正在逐步推进。
 
 This article discusses the advancements in Indistinguishability Obfuscation (iO), a cryptographic "holy grail" that hides program logic while preserving functionality. It highlights recent progress by Sora (standard assumptions) and Gauss Labs (non-standard assumptions). Practical applications, like secure voting and collusion-resistant multi-party systems, are explored, alongside challenges like validator collusion. Although iO remains inefficient and theoretical, its potential in blockchain, zkSNARKs, and beyond is immense, with ongoing efforts to make it practical.
 - <https://www.leku.blog/io/>
@@ -28,9 +28,9 @@ The tool, `coq-of-noir`, translates Noir programs into Coq for formal verificati
 The article highlights AlphaProof's solutions to three challenging IMO 2024 problems (1, 2, and 6) using the Lean proof assistant. 
 - <https://rishimehta.xyz/2024/11/17/alphaproofs-greatest-hits.html>
 ### New quantum algorithm for approximate polynomial interpolation
-the main strategy exploits Regev's reduction (that appeared initially in lattice-based crypto): one can exploit the existence of efficient decoders for Reed-Solomon codes and apply a QFT in order to get an efficient quantum algo for approximate polynomial intepolation
-
 主要策略利用了 Regev 的归约（最初出现在基于格的密码学中）：可以利用 Reed-Solomon 码的高效解码器，并通过应用量子傅里叶变换（QFT），从而得到一个用于近似多项式插值的高效量子算法。
+
+the main strategy exploits Regev's reduction (that appeared initially in lattice-based crypto): one can exploit the existence of efficient decoders for Reed-Solomon codes and apply a QFT in order to get an efficient quantum algo for approximate polynomial intepolation
 - <https://x.com/letonyo/status/1859139146016534650>
 - <https://arxiv.org/abs/2411.12553>
 ### The DIF 2024 Hackathon List of Winners