))
How Binius Reduces Computational Complexity with Towers of Binary Fields
Manage episode 439724395 series 3570694
内容由HackerNoon提供。所有播客内容（包括剧集、图形和播客描述）均由 HackerNoon 或其播客平台合作伙伴直接上传和提供。如果您认为有人在未经您许可的情况下使用您的受版权保护的作品，您可以按照此处概述的流程进行操作https://zh.player.fm/legal。
This story was originally published on HackerNoon at: https://hackernoon.com/how-binius-reduces-computational-complexity-with-towers-of-binary-fields.
Discover how Binius leverages Towers of Binary Fields to enhance computational efficiency in Zero-Knowledge SNARKs.
Check more stories related to web3 at: https://hackernoon.com/c/web3. You can also check exclusive content about #zero-knowledge-proofs, #sin7y, #binius, #blockchain-technology, #binary-fields, #zk-cryptography, #towers-of-binary-fields, #good-company, and more.
This story was written by: @sin7y. Learn more about this writer by checking @sin7y's about page, and for more stories, please visit hackernoon.com.
The Ulvetanna (IRREDUCIBLE) team addressed this question in their research paper titled Succinct Arguments over Towers of Binary Fields. They implemented it in Rust with their project, Binius: a Hardware-Optimized SNARK. In Binius, Binary Fields are constructed using towers of field extensions.
1036集单集
分享
