RISC-V Zero-Knowledge Prover for Fast Post-Quantum Execution Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing zero knowledge proof (ZKP) systems face challenges in efficiently proving the execution of complex computations, particularly in Von Neumann architectures, with impractical verification times and reliance on non-post-quantum cryptographic primitives, limiting their scalability and practical application.
Innovation Solution
A recursive ZKP system is developed that utilizes arithmetic circuits and secure mathematical transformations, specifically for RISC-V architectures, to efficiently prove the execution of computations by converting processor operations into polynomial constraints, optimizing verification time and ensuring post-quantum security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If existing ZKP systems are used to prove execution of complex computations, then proof completeness is achieved, but verification time becomes impractical
Solution Approach 1:
The patent segments the verification process by introducing a trusted setup phase that pre-computes and publishes common reference strings (CRS) and proof of proximity (PoP) parameters. This separates the heavy computational burden from the actual verification process, allowing proofs to be verified efficiently without sacrificing completeness.
Solution Approach 2:
The patent performs preliminary actions by pre-computing the common reference strings and proof of proximity parameters during a trusted setup phase before any actual proofs are generated or verified. This preliminary computation enables subsequent fast verification while maintaining proof validity.
2Reliability
If existing ZKP systems are used for complex computations, then proof validity is ensured, but scalability is limited
Solution Approach 1:
The patent creates a universal proof system that can handle multiple types of computations and verification scenarios through the general framework of proof of proximity. The common reference strings and PoP parameters can be reused across different proof instances, enabling scalable verification of diverse computational tasks.
Solution Approach 2:
The patent changes the parameters of the proof system by introducing proof of proximity parameters and common reference strings that can be adjusted and optimized for different computational scales. This allows the system to scale from small to large computations while maintaining validity.
3Reliability
If traditional cryptographic primitives are used in ZKP systems, then proof security is achieved, but post-quantum security is not ensured
Solution Approach 1:
The patent changes the cryptographic parameters by using hash functions and arithmetic operations over finite fields that are resistant to quantum attacks. The proof of proximity mechanism uses these post-quantum secure primitives while maintaining the same security guarantees as traditional systems.
Solution Approach 2:
The patent substitutes traditional cryptographic mechanisms with proof of proximity mechanisms that rely on hash functions and arithmetic circuits rather than traditional public key cryptography. This substitution provides post-quantum security while maintaining proof validity.
Data Source
AI summary
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for implementing a zero knowledge prover are disclosed. In one aspect, a method includes the actions of accessing an instruction set of a processor. The actions include generating a representation of a computing instruction using Boolean logic operations. The actions include assigning a polynomial constraint of a group of polynomial constraints to each Boolean logic operation. The actions include providing, to the processor, an executable program that includes various computing instructions and a request to execute the executable program. The actions include monitoring a value of a register of the processor. The actions include determining whether the value of the register complies with polynomial constraints of the group of polynomial constraints that correspond to instructions performed on the register. The actions include determining whether the execution of the executable program by the processor has been interfered with.