process of computing that statement is true

example: verification of signature

given neuron, signal and signature

validators of vimputer can verify

that signal is indeed authenticated by signing neuron

Dimensions

genies/docs/explanation/verification
verification: folding F_q into F_p genies computes over a 512-bit CSIDH prime. zheng proves over a 64-bit Goldilocks prime. the verification problem is: how do you prove that 512-bit arithmetic was performed correctly using a proof system that only understands 64-bit arithmetic? the answer is…
trop/docs/explanation/verification
verifying optimality: LP duality for proofs computing a shortest path is easy. proving it is optimal is the hard part. LP duality provides the mathematical machinery: every optimization result comes with a dual certificate that can be checked in polynomial time using field arithmetic. the tropical…
genies/specs/verification
verification how genies arithmetic folds into zheng proofs. the folding challenge genies operates over F_q (512-bit CSIDH prime). zheng operates over F_p (Goldilocks, 64-bit). to prove correctness of an isogeny computation, F_q arithmetic must be emulated as F_p constraints. F_q element…
trop/specs/verification
optimality verification how zheng proves that a tropical computation produced an optimal result. the verification principle tropical execution produces a primal solution (the optimal value and witness). the proof of optimality requires a dual certificate — a witness that no better solution exists.…

Local Graph