Mastering Polynomial Commitments - A Beginner's Guide to the KZG Polynomial Commitment
TLDR
The KZG commitment scheme is like a cryptographic vault for securely locking away polynomials (mathematical equations) so that you can later prove you have them without giving away their secrets. It’s like making a sealed promise that you can validate without ever having to open it up and show the contents. Using advanced math based on elli...
Paper Review - Mastering Concurrency in Computer Science - A New Educational Approach
Paper Review - Teaching Concurrency by Leslie Lamport
Unraveling the Complexities of Concurrency: A New Paradigm for Teaching
In the realm of computer science, concurrency stands as a foundational concept, pivotal to the design and operation of modern computing systems. Despite its significance, the approach to teaching concurrency has often b...
Understanding Column vs. Row Encoding in Rank-1 Constraint Systems - A Cryptographic Perspective
Understanding Column vs. Row Encoding in Rank-1 Constraint Systems: A Cryptographic Perspective
Introduction
In the realm of cryptographic protocols, particularly those involving zero-knowledge proofs (ZKP), the efficiency and complexity of computations are of great importance. Rank-1 Constraint Systems (R1CS) play a crucial role in this contex...
Error Correction in Ethereum's Danksharding - Harnessing the Power of Generalized Reed-Solomon Codes for Ethereum's Scalability
Danksharding is an innovative approach to scale Ethereum’s blockchain, aiming to achieve over 100,000 transactions per second by enabling rollups to add cheaper data to blocks ethereum.org. As Ethereum moves towards Proto-Danksharding and eventually full Danksharding ethereum.org, data extraction and interpolation become crucial aspects of the b...
The Ultimate Guide to Working with ZKSNARKS and Cryptographic Primitives - From Trusted Setup to Workflow Automation
Overview
Trusted Setup
Powers of Tau Ceremony
Exercises - Trusted Setup
Non-Quadratic Constraints
Exercises - Non-Quadratic Constraints
Groth16 and PLONK Protocols
Proof Generation, Computing Witness, Verification and Testing
Overview
ZKSNARKS are a powerful cryptographic tool that can enabl...
GCD - A Deep Dive into Fundamental Concept in Number Theory
Greatest Common Divisor Overview
Definition 1 - GCD
Definition 2 - Co-prime
Proposition 1
The Euclidean Algorithm
Geometrical View of the Euclidean Algorithm
The Extended Euclidean Algorithm
Theorem 1
Proposition 2
Theorem 2
Greatest Common Divisor Overview
T...
Mastering Rank One Constraint System R1CS with Circom Examples
Overview
Understanding the Role of R1CS in ZK Protocols
Definition and Explanation of R1CS
Relation to Circuits of Logical Gates
Constructing R1CS for Zero Knowledge Proofs
Circom R1CS Examples
Example 1
Ex1 R1CS Constraint Explanation
Ex1 Sagemath Implementation
...
Paper Review - Zero Knowledge Proofs for Decision Tree Predictions and Accuracy
IN DRAFT MODE
Summary
Machine learning has become increasingly prominent and is widely used in various applications in practice. Despite its great success, the integrity of machine learning predictions and accuracy is a rising concern. The reproducibility of machine learning models that are claimed to achieve high accuracy remains challenging, ...
62 post articles, 8 pages.