Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
vitalik.eth.limo
|
|
| | | | | [AI summary] The user is interested in understanding polynomial commitments and their applications in privacy-preserving computations, particularly in blockchain. They have provided a detailed overview of FRI, Kate, and bulletproofs, along with finite field arithmetic and encoding computations into polynomial equations. The user is looking for a concise summary of the key points, further clarification on the concepts, and guidance on how to proceed with learning more about the topic. | |
| | | | |
zkplabs.network
|
|
| | | | | Sangria, an innovative folding scheme for the PLONK arithmetization, represents a significant advancement in the field of incrementally verifiable computation (IVC). | |
| | | | |
blog.trailofbits.com
|
|
| | | | | ||
| | | | |
www.netmeister.org
|
|
| | | It's 2024 - do you know where your post-quantum cryptography is? | ||
