如果你重视零知识证明技术信息的实效性和信息源质量的意义,不想娱乐至死、短视投机、无关广告、推荐算法、劣币驱逐良币的泥沙裹挟迷失,请多支持我们(包括给予赞助支持),让这一汨清流继续流淌~
这篇博客讨论了分布式基于 FRI 的 SNARK 证明生成方案。方案将不同子多项式的证明过程分配到不同的证明者上,利用这些子多项式都符合低阶多项式检查的特性来组合它们,减少了计算和通信开销。
WHIR 既是里德-所罗门编码的 IOPP,也是多线性多项式承诺方案(PCS),并在所有此类方案中实现了最快的验证速度,甚至包括具有可信设置的单变量 PCS。 它在保持基于哈希方案的最先进参数大小和验证器哈希复杂度的同时,只需要透明设置并保证后量子安全。
The universal ZK settlement layer that makes any exchange Provable. xOS leverages @RiscZero's ZK prover with @CelestiaOrg underneath to prove off-chain transactions on-chain.
This article provides a friendly exposition to the new paper: “Really Complex Codes with Application to STARKs” by @Yuval_Domb
Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable. It deserves to be known as the standard method of polynomial interpolation.
the first distributed zkVM prover network openly accessible to anyone – is now live
"It's a great week for Basefold! First, WHIR combines Basefold and STIR to yield an efficient multilinearPCS with the best of both constructions. Next, this work proves the size of Basefold-FRI is equal to the size of traditional univariate FRI 🎉" [Hadas Zeilberger@idocryptography]
If you’d like to receive updates via email, click subscribe. Stay informed and never miss a post!
And our YouTube channel
如果觉得我的文章对您有用,请随意打赏。你的支持将鼓励我继续创作!