Skip to main content

prove_range

oxilean_std::zero_knowledge_proofs::functions

Function prove_range 

Source 
pub fn prove_range(
    x: u64,
    lo: u64,
    hi: u64,
    params: &PedersenParams,
    seed: u64,
) -> Option<RangeProofBits>
Expand description

Prove that lo ≤ x ≤ hi using bit decomposition.

Decomposes v = x - lo into bits b_0, …, b_{k-1} (k = ceil(log2(hi-lo+1))). For each bit produces a DlogProof of g^{b_i} mod p using params.g as generator.

Returns None if x < lo or x > hi.