如果你重视零知识证明技术信息的实效性和信息源质量的意义，不想娱乐至死、短视投机、无关广告、推荐算法、劣币驱逐良币的泥沙裹挟迷失，请多支持我们（包括给予赞助支持），让这一汨清流继续流淌～
Highlights
NIST PQC 正式标准发布
Additive NTT (ANTT) by Ingonyama
有限扩展域上的加法 FFT 出现于 20 世纪 80 年代末。 我们将加法 FFT 称为加法 NTT (ANTT)，是对加法子群而非乘法子群的求值。有趣的是，它们根本不是傅里叶变换，但它们服从类似 FFT 的递归结构，实现了 $O(nlogn)$ 复杂度。链接是参考的书籍和 Ingonyama 为 Open-Binius 项目实现的 python 参考代码。
Fibonacci Air Implementation in Plonky3
This repo implements a Fibonacci sequence generator and prover using the Plonky3 framework.
Lemma: ZK Theorem Proving
Lemma is a ZK theorem proving framework that enables individuals to post unsolved theorem definitions accompanied by a bounty for anyone that can submit a valid Mathematical proof which solves the theorem. These proofs are validated on chain, and the bounties are trustlessly released to the solver.
Cryptographic Right Answers: Post Quantum Edition
后量子加密技术（PQC）的前景复杂而充满挑战，新算法和新标准不断涌现，如 Kyber、Dilithium 和 SPHINCS+，它们提供了更高的安全性，可抵御量子攻击。要驾驭这一格局，开发人员应优先使用成熟的加密库，避免定制实现，并专注于混合方案。
The post-quantum cryptography (PQC) landscape is complex and challenging, with new algorithms and standards emerging, such as Kyber, Dilithium, and SPHINCS+, which offer improved security against quantum attacks. To navigate this landscape, developers should prioritize using established cryptographic libraries, avoiding custom implementations, and focusing on hybrid schemes.
Updates
Sparta(0)
Rust implementation of the SuperSpartan IOP
Papers
Succinct Non-Subsequence Arguments
Hekaton: Horizontally-Scalable zkSNARKs via Proof Aggregation
Hekaton 构造了一个新的「分发-聚合」框架，可以高效处理任意大规模计算。该框架将大型计算分解成小块，在分布式系统中并行证明这些小块，然后将得到的小块证明聚合成一个简洁的证明。实验表明 Hekaton 实现了很强的横向可扩展性（证明时间随着集群中节点数量的增加而线性减少），并且能够快速证明大型计算：它可以在一小时内证明大小为 $2^{35}$ 个门的电路，这比之前的工作快得多。
Learnings
Abstract Algebra Online Course
抽象代数涉及群、环、场和模块。这些抽象结构出现在许多不同的数学分支中，包括几何、数论、拓扑学等。它们甚至出现在量子力学等科学课题中。
Abstract Algebra deals with groups, rings, fields, and modules. These are abstract structures which appear in many different branches of mathematics, including geometry, number theory, topology, and more. They even appear in scientific topics such as quantum mechanics.
Galois Theory Notes
The author has arXived their Galois theory course notes from 2021-2023, making them publicly available along with other course materials. The author notes that the Galois theory notes have been particularly popular, possibly due to their visually appealing format with color and icons.
Discrete Mathematics: An Open Introduction, 4th edition
Essential Coding Theory
zkML: Tradeoffs in accuracy vs. proving cost
为了展示 ML 模型准确性与 SNARK 成本之间的权衡，作者使用 EZKL zkML 框架进行了概念验证，目标是强调准确性的微小提高如何可能导致巨大的计算开销，从而鼓励人们在构建需要可验证性的模型时，深思熟虑地考虑这些权衡因素。这篇文章详细介绍了这一过程，包括数据预处理、模型训练和证明生成。
-
原创
- 学分: 6
- 分类: Solidity合约
- 标签:
