Blockchain Locking Scripts With Zero-Knowledge Proofs for Private Validation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing blockchain locking scripts face limitations in security, privacy, and flexibility, particularly in scenarios where unlocking scripts reveal sensitive data, compromising security and privacy.

Innovation Solution

Implementing non-interactive zero-knowledge proofs in locking scripts to verify knowledge of a secret witness without revealing the solution, ensuring security and privacy by using a challenge solution π that computes a candidate commitment value and hash value to validate transactions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional locking scripts are used to verify transactions, then transaction validation is straightforward and efficient, but sensitive data in unlocking scripts is exposed, compromising security and privacy

Engineering Contradiction:
Improvetransaction validation reliabilityVSAvoiddata exposure and privacy loss
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent introduces a cryptographic intermediary (hash function or commitment scheme) between the unlocking script data and the locking script verification. Instead of directly exposing sensitive data in the unlocking script, the system uses a commitment value C = Hash(data || nonce) as an intermediary. The locking script verifies the commitment without seeing the actual data, while the unlocking script provides proof of knowledge of the data without revealing it. This intermediary mechanism resolves the contradiction by enabling validation while protecting privacy.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces the traditional mechanical/crypto system where unlocking scripts directly contain or reveal sensitive data with a zero-knowledge proof system. Instead of the conventional approach where the unlocking script literally contains the secret, the system substitutes this with a mathematical proof structure (zk-SNARKs or similar) that verifies knowledge of the secret without exposing it. This substitution transforms the verification mechanism from direct data exposure to indirect proof validation, maintaining reliability while eliminating privacy harm.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Ease of operation

If unlocking scripts reveal secret data to validate transactions, then transaction verification is simple and direct, but security and privacy are compromised

Engineering Contradiction:
Improvetransaction verification simplicityVSAvoidsecurity and privacy
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent segments the transaction verification process into distinct components: (1) commitment generation in the unlocking script, (2) commitment verification in the locking script, and (3) optional zero-knowledge proof verification. By segmenting the process, the system maintains operational simplicity at each stage while achieving overall security. The unlocking script remains simple by providing a commitment, the locking script remains simple by verifying the commitment, and security is achieved through the cryptographic properties of the segmentation approach.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The commitment value C serves as an intermediary that simplifies the verification process while maintaining security. Instead of complex direct verification of secrets, the system uses the commitment as a mediator that both parties can work with independently. The locking script verifies the commitment against the target value, and the unlocking script provides the commitment without revealing the underlying secret. This intermediary simplifies operations while preserving reliability.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Adaptability or versatility

If traditional locking scripts are used, then compatibility with existing blockchain systems is maintained, but flexibility and security are limited

Engineering Contradiction:
Improvelocking script flexibilityVSAvoidsecurity
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The patent creates a universal locking script structure that can serve multiple functions: traditional payment verification, confidential transactions, and zero-knowledge proof verification. The locking script format remains compatible with existing blockchain systems while incorporating additional verification capabilities. The unlocking script can provide different types of proofs depending on the specific use case, making the system versatile while maintaining security through the unified commitment-based approach.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent changes the verification parameter from direct secret data to cryptographic commitments and proof structures. By changing the parameter being verified (from secret values to commitment values and proof validity), the system achieves greater flexibility in what can be verified while improving security. The locking script verifies cryptographic parameters rather than raw secret data, enabling enhanced security and flexibility without breaking compatibility with the underlying blockchain verification mechanisms.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS20250267019A1Blockchain transaction
Publication Date: 2025.08.21 NCHAIN LICENSING AG
  • US20250267019A1 patent drawing
  • US20250267019A1 patent drawing
  • US20250267019A1 patent drawing

AI summary

A computer-implemented method for generating a blockchain transaction is provided. A first locking script of a challenge blockchain transaction comprising a target statement and a verification script for verifying a challenge solution π provided in a first unlocking script of a proof blockchain transaction is generated. The challenge solution π is a non-interactive zero-knowledge proof proving knowledge of a secret witness w. The first locking script, when executed with the first unlocking script, is configured to: compute, based on the challenge solution π and one of the target statement and a candidate statement provided in the first unlocking script, a candidate commitment value A*; compute, using the candidate commitment value A* and one of the target and candidate statements, a candidate hash value; verify, based on the candidate hash value, the challenge solution π; and verify that the challenge solution π is provided in the proof blockchain transaction.