Category: Uncategorized

From lib.rs, there is test, checking prove simple:

check what this prove simple means

there are some prove and compile, prove recursion basic function in this file.

Compile:

In the compile function, there are two functions til now I think it is important: instruction_to_airs and customize

Instructions_to_airs:

in this instruction …

I am using a simplified circuit for case demonstration purpose:

The bus statement to be proved is:

$[x_0,x_1]$ in [0] with $bus_{id}$=a,

this case has only one valid witness [0,0], with multiplicity to be 2

Original protocol:

The above statement essentially proves:

$\frac{1}{\alpha -x_0}+\frac{1}{\alpha -x_1}=\frac{2}{\alpha}$

where $\alpha$ is a random …

Follow my first post for Spartan

Closed-form expression for evaluating a polynomial

The closed-form expression for evaluating a polynomial $\mathcal{G}(\cdot)$ at $(r_1,…,r_m)\in \mathbb{F}^m$ is

$$\mathcal{G}(r_1,…,r_m)=\sum\limits_{x\in\{0,1\}^m}\mathcal{G}(x)\prod\limits^{m}_{i=1}\underbrace{(r_i\cdot …

We give a commit-and-prove zero-knowledge argument Protocol for the satisfiability of a QAP for an arithmetic circuit $C$. For wires in the circuit $\{a_i\}_{i=0}^n$, we denote the input witnesses are $\{a_i\}_{i=0}^k$, the inner circuit witnesses are $\{a_{i}\}_{i=k+1}^l$ and the statements wires are $\{a_{i}\}_{i=l+1}^n$. The quadratic arithmetic program, Pedersen commitment and …