Blockchain Knowledge Proof Using Schnorr Off-Chain Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing knowledge proof systems for blockchain transactions are computationally costly, limiting their versatility and efficiency in applications beyond cryptocurrency.

Innovation Solution

A computationally efficient knowledge proof system is implemented using Schnorr's identification scheme, allowing for on-chain non-interactive transactions and signature schemes, where public verification keys are hidden and calculations are performed off-chain to save computation, and enabling smart contracts and token systems to verify ownership and asset transfer.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If existing knowledge proof systems are used for blockchain transactions, then security and verification capability are improved, but computational cost and processing time increase significantly

Engineering Contradiction:
Improveverification capabilityVSAvoidcomputational efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The knowledge proof system is segmented into distinct cryptographic components (commitment generation, challenge-response protocols, verification routines) that can be independently optimized and executed. This modular structure allows selective implementation of computationally intensive operations only when needed, improving overall system efficiency while maintaining verification capability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Commitment values are generated and published in advance before the actual knowledge proof verification occurs. This preliminary action allows the verification process to proceed more efficiently by using pre-computed values, reducing the computational burden during the actual verification phase while maintaining security.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If knowledge proof systems are implemented on-chain, then transparency and immutability are improved, but computational resources and transaction costs increase

Engineering Contradiction:
ImprovetransparencyVSAvoidcomputational resources
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

Computationally intensive knowledge proof operations are extracted from the main blockchain transaction flow and performed off-chain or in separate verification steps. Only essential verification results are recorded on-chain, reducing the computational resources consumed by the blockchain network while maintaining transparency through public verification of proof validity.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

A separate verification layer or intermediary mechanism is introduced that handles the computationally intensive knowledge proof verification outside the main blockchain consensus process. This intermediary performs the heavy lifting of verification while the blockchain maintains transparency through recording of verification outcomes, separating computation from consensus.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS12445287B2Computer implemented method and system for knowledge proof in blockchain transactions
Publication Date: 2025.10.14 NCHAIN LICENSING AG
  • US12445287B2 patent drawing
  • US12445287B2 patent drawing
  • US12445287B2 patent drawing

AI summary

A method of enabling knowledge proof in a blockchain transaction is disclosed. The method comprises sending, from a verifier to a prover, a blockchain transaction redeemable by means of data including (i) first data (y) based on a combination of an ephemeral key (r), second data (c) and a private key of a public-private key pair of a cryptography system, wherein the public key (v) is based on an integer generator raised to a first power, wherein the first power is based on the private key, and wherein knowledge of the private key is required in order to determine the ephemeral key from the first data, and (ii) third data (x) based on the integer generator raised to a second power, wherein the second power is based on the ephemeral key.