Struct ZkProofSystem 

pub struct ZkProofSystem { /* private fields */ }

Zero-Knowledge Proof System

Implementations

impl ZkProofSystem

pub fn new() -> Self

pub fn create_circuit(&mut self, circuit_id: String) -> Result<(), ZkError>

pub fn add_variable( &mut self, circuit_id: &str, variable_id: String, variable_type: VariableType, ) -> Result<(), ZkError>

Add variable to circuit

pub fn add_constraint( &mut self, circuit_id: &str, left: CircuitExpression, right: CircuitExpression, output: CircuitExpression, ) -> Result<(), ZkError>

Add constraint to circuit

pub fn generate_keys(&mut self, circuit_id: &str) -> Result<(), ZkError>

Generate proving and verifying keys

pub fn generate_proof( &mut self, circuit_id: &str, witness: HashMap<String, FieldElement>, public_inputs: Vec<FieldElement>, ) -> Result<ZkProof, ZkError>

Generate zero-knowledge proof

pub fn verify_proof( &mut self, proof: &ZkProof, ) -> Result<VerificationResult, ZkError>

Verify zero-knowledge proof

pub fn generate_semantic_proof( &mut self, statement: MathematicalStatement, witness: HashMap<String, FieldElement>, ) -> Result<SemanticProof, ZkError>

Generate semantic proof for mathematical statement

pub fn verify_semantic_proof( &mut self, semantic_proof: &mut SemanticProof, ) -> Result<(), ZkError>

Verify semantic proof

pub fn prove_matrix_multiply( &mut self, m: usize, k: usize, n: usize, a: &[i128], b: &[i128], ) -> Result<(bool, Vec<i128>), ZkError>

Prove, in zero knowledge, that C = A·B where A is m×k and B is k×n (both row-major, integer field values), WITHOUT revealing A or B.

This builds a real R1CS circuit: every A[i][p] and B[p][j] is a private witness, every result entry C[i][j] is a public input, and for each (i,j) the circuit enforces Σ_p A[i][p]·B[p][j] = C[i][j]. A Groth16 proof over that circuit is generated and verified. Ok(true) means the proof verifies — i.e. the prover really knows A, B whose product is the published C. (Contrast the previous placeholder, which proved an empty circuit and attested nothing.)

C is computed here from the integer inputs so the constraint is exact; the returned flag reflects genuine cryptographic verification, not a structural check. The result entries are returned so the caller can publish/compare them.

pub fn get_performance_stats(&self) -> ZkGlobalMetrics

Get performance statistics

pub fn list_circuits(&self) -> Vec<String>

List all circuits

pub fn get_circuit_info(&self, circuit_id: &str) -> Option<ArithmeticCircuit>

Get circuit information