Enhanced distributed zero-knowledge proof generation

By decomposing workflow graphs into subgraphs and generating subproofs in a distributed manner, the system addresses the inefficiencies of existing ZKP systems, achieving scalable and efficient ZKP generation for large-scale data analysis workflows.

HK40135021APending Publication Date: 2026-07-17THE HONG KONG UNIV OF SCI & TECH
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
HK · HK
Patent Type
Applications
Current Assignee / Owner
THE HONG KONG UNIV OF SCI & TECH
Filing Date
2026-05-15
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing zero-knowledge proof (ZKP) systems for data analysis workflows are computationally prohibitive and inefficient, especially for large-scale tasks, as they often require generating a single monolithic proof for complex workflows, which is impractical and resource-intensive.

Method used

A system that decomposes a workflow graph into subgraphs, determines subproofs for each part, and generates ZKPs in a distributed manner, allowing parallel processing and reuse of subproofs for similar tasks, thereby reducing redundant computations and improving efficiency.

Benefits of technology

This approach enhances the scalability, efficiency, and modularity of ZKP generation, reducing computational load and time by enabling parallel processing and reusing subproofs, thus optimizing the proof generation process for large-scale data analysis workflows.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 00000000_0000_ABST
    Figure 00000000_0000_ABST
Patent Text Reader

Abstract

Zero-knowledge proof (ZKP) generation can be enhanced managed and performed. A proof manager can decompose a directed acyclic graph (DAG) representing a data analytics workflow into respective sub-DAGs representing respective workflow portions. Based on the respective sub-DAGs, the proof manager can determine respective sub-ZKPs related to the respective workflow portions and sub-DAGs. The respective sub-ZKPs can be determined concurrently using respective servers. The proof manager can hash respective input values and output values of the respective sub-DAGs and include respective hash values in the respective sub-ZKPs. Based on linking the respective sub-ZKPs having respective hash values that satisfy a prescribed matching criterion, the proof manager can determine and generate a ZKP related to the workflow including a computation result. The proof manager can communicate the ZKP to a verifier to facilitate verification of correctness of the ZKP including the computation result. The proof manager can store the sub-ZKPs and reuse the stored sub-ZKPs related to computations of sub-DAGs of another workflow.
Need to check novelty before this filing date? Find Prior Art