Home

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 ...

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, ...

Introduction ElGamal Encryption Enhancing Security of ElGamal Encryption Finding a Safe Generator Practical Applications of ElGamal Encryption Conclusion Introduction ElGamal encryption is a widely-used public key encryption algorithm that provides confidentiality and security in communication systems. It was proposed by Taher ElGam...

Rate Limiting Nullifier (RLN) Review I recently had the pleasure of conducting my first security audit of a Zero Knowledge Proofs (ZKP) protocol. The protocol in question was the Rate Limiting Nullifier (RLN) Zero Knowledge Proofs Protocol, with its circuits written in Circom. My main focus during this review was on the Circom Circuits of the Z...

Introduction Problem Explanation Problem Definition Weighted Set Cover Solution Greedy Algorithm Implementation in SageMath Example Scenario Applications in Blockchain Technology and Machine Learning Blockchain Transaction Fee Optimization Machine Learning Feature Selection Relating to Karp Reduction Conc...

Introduction Demystifying Elliptic Curves and Their Applications The Power of Elliptic Curve Cryptography (ECC) Unlocking the Potential of ECC with SageMath Understanding the Fundamentals of Elliptic Curves Definition of an Elliptic Curve Points on an Elliptic Curve Visualizing Points on an Ellip...

This article would provide an in-depth understanding of how product codes from algebraic coding theory can be applied to Danksharding to improve Ethereum’s scalability. It would cover the fundamentals of product codes, their application in Danksharding, and the potential benefits for Ethereum’s network. Product Codes and Their Relation to Da...

In this blog post, we will explore an efficient method to compute the Frobenius automorphism for the BN254 elliptic curve. The BN254 curve is a pairing-friendly elliptic curve that is widely used in cryptographic applications hackmd.io/@jpw. We will exploit the fact that $(p−1)/2$ is odd to compute the Frobenius automorphism efficiently. What i...