Zero-Knowledge Proof Method Patent Application US20260100838A1
Summary
USPTO published patent application US20260100838A1 for a computer-implemented zero-knowledge proof method by inventor Enrique LARRAIA. The application, filed August 16, 2023 under Application No. 19114378, covers generating zero-knowledge proofs to verify knowledge of pre-image values using compression function instances across a series of nodes. The invention is classified under H04L 9/3218, H04L 9/0643, and H04L 2209/30.
What changed
USPTO published patent application US20260100838A1 disclosing a computer-implemented method for generating zero-knowledge proofs to verify knowledge of pre-image values. The method uses compression function instances evaluated across a series of nodes, with each node verifying correct evaluation and outputting a proof. Invented by Enrique LARRAIA, the application was filed August 16, 2023.\n\nTechnology companies and software developers working with cryptographic methods, authentication systems, or blockchain technologies should monitor this application for potential patent landscape implications. Patent applications do not grant enforceable rights until formally examined and issued.
What to do next
- Monitor for patent grant updates
Archived snapshot
Apr 11, 2026GovPing captured this document from the original source. If the source has since changed or been removed, this is the text as it existed at that time.
ZERO-KNOWLEDGE PROOF
Application US20260100838A1 Kind: A1 Apr 09, 2026
Inventors
Enrique LARRAIA
Abstract
A computer-implemented method for generating a zero-knowledge proof for proving knowledge of a pre-image value. A series of pre-image blocks is obtained which, when combined, form the pre-image value. A series of nodes are executed, wherein each node of the series is configured to: receive a respective current state and a respective current iteration counter; evaluate an instance of a predefined compression function, based on the respective current state, to compute a respective next state; increment the respective current iteration counter to generate a respective next iteration counter; determine, based on a respective next pre-image block of the series of pre-image blocks, that the predefined compression function instance has been evaluated correctly; and output a proof, wherein the proof attests to the predefined compression function instance being evaluated correctly. The proof generated by a final node of the series of nodes proves knowledge of the pre-image value.
CPC Classifications
H04L 9/3218 H04L 9/0643 H04L 2209/30
Filing Date
2023-08-16
Application No.
19114378
Related changes
Get daily alerts for USPTO Patent Applications - Networking (H04L)
Daily digest delivered to your inbox.
Free. Unsubscribe anytime.
Source
About this page
Every important government, regulator, and court update from around the world. One place. Real-time. Free. Our mission
Source document text, dates, docket IDs, and authority are extracted directly from USPTO.
The summary, classification, recommended actions, deadlines, and penalty information are AI-generated from the original text and may contain errors. Always verify against the source document.
Classification
Who this affects
Taxonomy
Browse Categories
Get alerts for this source
We'll email you when USPTO Patent Applications - Networking (H04L) publishes new changes.
Subscribed!
Optional. Filters your digest to exactly the updates that matter to you.