))
How Binius Reduces Computational Complexity with Towers of Binary Fields
Manage episode 439724395 series 3570694
Content provided by HackerNoon. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by HackerNoon or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://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.
916 episodes
Share
