Polynomial - Свежие новости [ Фото в новостях ] | |
Synthetix внедряет первый протокол бессрочных контрактов на блокчейне Base
Synthetix, децентрализованный рынок криптовалютных деривативов, развернул V3 своего протокола бессрочных контрактов на Base, блокчейне Ethereum Layer-2, разработанном Coinbase. Perps V3 упростит запуск новых деривативов на Synthetix для разработчиков, работающих на Base, а также торговлю на биржах Synthetix, таких как Kwenta, Polynomial и dHEDGE, говорится в заявлении компании. дальше »
2024-1-25 17:26 | |
Understanding PLONK
Special thanks to Justin Drake, Karl Floersch, Hsiao-wei Wang, Barry Whitehat, Dankrad Feist, Kobi Gurkan and Zac Williamson for review Very recently, Ariel Gabizon, Zac Williamson and Oana Ciobotaru announced a new general-purpose zero-knowledge proof scheme called PLONK, standing for the unwieldy quasi-backronym “Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge”. дальше »
2019-9-24 04:03 | |
Ethereum’s Vitalik Buterin refutes allegations suggesting he tried to convince investors to fund a quantum computer
Prior to co-founding Ethereum, Vitalik Buterin, the “coding genius” was involved in the development of a computer program to solve NP-complete problems in polynomial time, supposedly by simulating a quantum computer for which, he allegedly collected funds from investors. дальше »
2019-6-23 21:30 | |
STARKs, Part I: Proofs with Polynomials
Special thanks to Eli Ben-Sasson for ongoing help, explanations and review, coming up with some of the examples used in this post, and most crucially of all inventing a lot of this stuff; thanks to Hsiao-wei Wang for reviewing Hopefully many people by now have heard of ZK-SNARKs, the general-purpose succinct zero knowledge proof technology that can be used for all sorts of usecases ranging from verifiable computation to privacy-preserving cryptocurrency. дальше »
2018-7-21 23:03 | |
STARKs, Part II: Thank Goodness It's FRI-day
Special thanks to Eli Ben-Sasson for ongoing help and explanations, and Justin Drake for reviewing In the last part of this series, we talked about how you can make some pretty interesting succinct proofs of computation, such as proving that you have computed the millionth Fibonacci number, using a technique involving polynomial composition and division. дальше »
2018-7-21 23:03 | |