Methods, non-transitory computer readable media, and query verification apparatuses are disclosed that receive data, store the data into a table of a database, and receive a query that is associated with the database table. A query plan and a query result are generated for the query, one or more partial proofs are generated from one or more commitments, and an overall proof is generated from the one or more partial proofs. Each of the one or more partial proofs is associated with at least one node of the query plan in some examples, which can include a directed acyclic graph. The overall proof is returned along with the query result in response to the query to facilitate verification of the query result. One or more GPUs are configured to generate the one or more commitments in some examples to thereby accelerate the verification process and improve database scalability.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
2. The method of claim 1, further comprising generating a query plan from the received query, wherein each of the one or more partial proofs is associated with at least one node of the query plan.
This invention relates to query processing in database systems, specifically improving efficiency by leveraging partial proofs during query execution. The problem addressed is the computational overhead in evaluating complex queries, particularly when certain sub-queries or conditions can be pre-evaluated or partially resolved before full query execution. The method involves receiving a database query and generating a query plan that breaks down the query into executable steps. Each step in the query plan is represented as a node, and the system associates one or more partial proofs with these nodes. Partial proofs are pre-computed or intermediate results that satisfy specific conditions or sub-queries, allowing the query engine to reuse these results rather than recomputing them. By linking partial proofs to query plan nodes, the system optimizes query execution by reducing redundant computations and improving performance. The partial proofs may be derived from prior query executions, materialized views, or other optimization techniques. The association between partial proofs and query plan nodes ensures that the system efficiently retrieves and applies these proofs during query execution, minimizing processing time and resource usage. This approach is particularly beneficial in large-scale database systems where query performance is critical.
3. The method of claim 2, wherein the database is a structured query language (SQL) database and the method further comprises generating the query plan with a SQL engine, wherein the query plan comprises a directed acyclic graph (DAG) comprising the at least one node.
This invention relates to optimizing database query performance, specifically for structured query language (SQL) databases. The problem addressed is the inefficiency in generating and executing query plans, which can lead to slow response times and high computational overhead. The solution involves a method for generating a query plan using a SQL engine, where the query plan is represented as a directed acyclic graph (DAG). The DAG includes at least one node, each representing an operation or step in the query execution process. The method ensures that the query plan is optimized for efficient data retrieval and processing, reducing latency and resource consumption. The DAG structure allows for parallel execution of independent operations, further improving performance. The invention enhances the ability of SQL databases to handle complex queries efficiently, making it particularly useful in large-scale data processing environments.
4. The method of claim 1, wherein the at least one prover device comprises a plurality of prover devices, the generating and storing the first commitment, receiving the query, and returning the success flag are performed by a verifier device separate from the plurality of prover devices, and the database comprises a decentralized database.
This invention relates to a decentralized verification system for proving data integrity in a distributed computing environment. The system addresses the challenge of securely verifying data stored across multiple devices without relying on a centralized authority, ensuring trust and transparency in decentralized databases. The system includes a plurality of prover devices that collectively generate and store a cryptographic commitment representing data. This commitment is a compact, verifiable representation of the data that can be used to prove its integrity later. A separate verifier device, distinct from the prover devices, interacts with the decentralized database to perform verification. The verifier generates a query to challenge the prover devices, which then respond by returning a success flag indicating whether the data matches the original commitment. The decentralized database ensures that the verification process is distributed, reducing reliance on a single point of control and enhancing security. The system leverages cryptographic techniques to ensure that the data remains tamper-proof and verifiable across multiple nodes. By separating the roles of prover and verifier, the system improves scalability and security, making it suitable for applications like blockchain, distributed ledgers, and secure data storage. The decentralized nature of the database further enhances fault tolerance and resistance to censorship.
7. The query verification apparatus of claim 6, wherein the first processor is further configured to execute the stored first programmed instructions to generate one or more immediate values.
8. The query verification apparatus of claim 7, wherein the one or more GPUs are further configured to execute the stored first programmed instructions to generate the one or more commitments from the one or more intermediate values.
This invention relates to query verification systems using graphical processing units (GPUs) for secure data processing. The system addresses the challenge of verifying the integrity and correctness of queries executed on sensitive data, particularly in environments where data privacy and security are critical. The apparatus includes one or more GPUs programmed to perform cryptographic operations, such as generating commitments from intermediate values produced during query execution. These commitments serve as verifiable proofs that the query was processed correctly without exposing the underlying data. The system ensures that the query results are tamper-proof and can be independently verified by a third party. The GPUs are also configured to handle other cryptographic functions, such as generating proofs of correct computation, which further enhances the security and trustworthiness of the query results. The apparatus is designed to operate efficiently within a secure computing environment, leveraging the parallel processing capabilities of GPUs to accelerate cryptographic operations while maintaining data confidentiality. This approach is particularly useful in applications like secure data analytics, privacy-preserving machine learning, and confidential cloud computing, where ensuring the integrity of query results is essential.
9. The query verification apparatus of claim 8, wherein the first processor is further configured to execute the stored first programmed instructions to generate the one more partial proofs form the one or more commitments.
The invention relates to a query verification apparatus designed to enhance data integrity and security in distributed systems, particularly in scenarios involving zero-knowledge proofs or cryptographic commitments. The apparatus addresses the challenge of efficiently verifying queries against large datasets without exposing sensitive information, ensuring both privacy and correctness. The apparatus includes a first processor configured to execute programmed instructions to generate one or more commitments from input data. These commitments are cryptographic representations that allow data to be verified without revealing the underlying information. The first processor is further configured to generate one or more partial proofs from these commitments. Partial proofs are derived fragments of a full proof, enabling incremental or selective verification of the data. This modular approach improves efficiency by allowing verification of only the necessary portions of the data, reducing computational overhead. The apparatus also includes a second processor configured to execute programmed instructions to verify the partial proofs against the commitments. This verification ensures that the partial proofs correctly represent the committed data, maintaining data integrity. The second processor may also reconstruct the full proof from the partial proofs if needed, allowing for comprehensive verification when required. By generating and verifying partial proofs, the apparatus enables efficient and secure query verification in distributed systems, supporting applications such as blockchain, secure data sharing, and privacy-preserving computations. The modular design allows for scalable and flexible verification processes, adapting to varying data sizes and verification requirem
12. The query verification apparatus of claim 6, wherein the database is a structured query language (SQL) database and the first processor is further configured to execute the stored first programmed instructions to generate the query plan with a SQL engine, wherein the query plan comprises a directed acyclic graph (DAG) comprising the at least one node.
This invention relates to a query verification apparatus designed to validate database queries, particularly for structured query language (SQL) databases. The apparatus includes a database and a processor configured to generate a query plan using a SQL engine. The query plan is represented as a directed acyclic graph (DAG), where the graph includes at least one node. The DAG structure allows for efficient analysis and verification of the query's logical flow and structure. The processor executes programmed instructions to process the query, ensuring it adheres to the database schema and syntax rules. The apparatus may also include a second processor to verify the query plan against predefined rules or constraints, ensuring the query is optimized and free of errors before execution. This system enhances database performance by preventing invalid or inefficient queries from being executed, reducing the risk of errors and improving query reliability. The invention is particularly useful in environments where query accuracy and performance are critical, such as enterprise databases or large-scale data processing systems.
13. The query verification apparatus of claim 6, wherein the prover device comprises a plurality of prover devices hosting the database, the verifier device is separate from the plurality of prover devices, and the database comprises a decentralized database.
A decentralized database system is used to verify queries in a distributed computing environment. The system includes multiple prover devices that collectively host the decentralized database, ensuring data is distributed across the network rather than stored in a single location. A separate verifier device is responsible for validating queries submitted to the database. The verifier device interacts with the prover devices to confirm the accuracy and integrity of the data being queried. This decentralized approach enhances security and reliability by eliminating single points of failure and reducing the risk of data tampering. The system is particularly useful in applications requiring high availability, such as blockchain, distributed ledgers, or peer-to-peer networks, where trustless verification is essential. The verifier device ensures that the data returned by the prover devices is consistent and unaltered, providing a robust mechanism for query validation in decentralized systems.
15. The non-transitory computer readable medium of claim 14, wherein the one or more partial proofs are generated from one or more commitments generated from one or more intermediate values using one or more graphics processing units (GPUs).
This invention relates to cryptographic proof generation using graphics processing units (GPUs) to enhance computational efficiency. The technology addresses the problem of generating cryptographic proofs, particularly partial proofs, in a computationally intensive manner, by leveraging the parallel processing capabilities of GPUs to accelerate the process. The system involves generating commitments from intermediate values, which are then used to produce partial proofs. These commitments and proofs are essential for verifying the integrity and authenticity of data in cryptographic systems, such as zero-knowledge proofs or other privacy-preserving protocols. The use of GPUs allows for faster computation compared to traditional central processing units (CPUs), making the proof generation process more scalable and efficient. The invention is particularly useful in applications requiring high-performance cryptographic operations, such as blockchain systems, secure authentication, or distributed ledger technologies, where rapid proof generation is critical for maintaining system performance and security. By offloading the computationally heavy tasks to GPUs, the system reduces latency and improves throughput, enabling real-time or near-real-time cryptographic operations. The approach is adaptable to various cryptographic schemes and can be integrated into existing systems to enhance their performance.
16. The non-transitory computer readable medium of claim 14, wherein the database is a structured query language (SQL) database and the executable code, when executed by the one or more processors, causes the one or more processors to generate the query plan via a SQL engine.
This invention relates to database query optimization, specifically improving the efficiency of query execution in structured query language (SQL) databases. The problem addressed is the need for optimized query plans to reduce processing time and resource consumption when executing complex database queries. Traditional query optimization techniques often fail to account for dynamic data distributions or evolving query patterns, leading to suboptimal performance. The invention involves a system that generates query plans using a SQL engine to analyze and optimize database queries. The system includes a database, typically a SQL database, and executable code that runs on one or more processors. The executable code processes query requests, evaluates the structure and content of the database, and generates an optimized query plan. The SQL engine plays a central role in this process, analyzing query syntax, table relationships, and indexing strategies to produce an efficient execution path. The system may also incorporate machine learning or statistical models to refine query plans based on historical performance data, ensuring adaptability to changing workloads. The goal is to minimize execution time, reduce resource usage, and improve overall database performance.
17. The non-transitory computer readable medium of claim 14, wherein the query plan comprises a directed acyclic graph (DAG) comprising the at least one node.
This invention relates to database query optimization, specifically improving the efficiency of query execution plans. The problem addressed is the need for more flexible and efficient query plan representations that can adapt to complex database operations. Traditional query plans often use rigid structures that limit optimization opportunities. The invention describes a non-transitory computer-readable medium storing instructions for generating and optimizing a query plan. The query plan is represented as a directed acyclic graph (DAG), where each node in the graph corresponds to an operation or sub-operation within the query. The DAG structure allows for parallel execution of independent operations, dynamic reordering of steps, and efficient reuse of intermediate results. The system can analyze the DAG to identify optimization opportunities, such as merging operations, eliminating redundant computations, or reordering steps to minimize resource usage. The DAG-based approach enables more sophisticated optimizations compared to linear or tree-based query plans, particularly for complex queries involving multiple joins, aggregations, or subqueries. The invention also includes methods for constructing the DAG from a query, analyzing dependencies between nodes, and executing the optimized plan efficiently. This approach improves query performance by reducing execution time and resource consumption.
18. The non-transitory computer readable medium of claim 14, wherein the at least one prover device comprises a plurality of prover devices and the database comprises a decentralized database.
A system for secure data verification involves a decentralized database and multiple prover devices that generate cryptographic proofs to validate data integrity. The decentralized database stores data in a distributed manner, ensuring resilience against single points of failure. Each prover device independently verifies the authenticity and consistency of data entries by generating cryptographic proofs, such as zero-knowledge proofs or digital signatures, which are then stored in the database. These proofs allow any verifier to confirm the validity of the data without requiring direct access to the original data source. The system enhances security by distributing trust across multiple prover devices, reducing the risk of tampering or unauthorized modifications. The decentralized nature of the database ensures that data remains available even if some nodes fail or are compromised. This approach is particularly useful in applications requiring high levels of data integrity, such as financial transactions, supply chain tracking, or identity verification, where centralized systems may be vulnerable to attacks or failures. The use of cryptographic proofs ensures that data remains tamper-evident and verifiable by any authorized party.
19. The non-transitory computer readable medium of claim 14, wherein the first commitment is generated and stored, the query is received, and the success flag is returned, by a verifier device separate from the at least one prover device.
This invention relates to a system for verifying data integrity in a distributed computing environment, addressing challenges in securely confirming the authenticity and correctness of data without exposing sensitive information. The system involves a verifier device that independently generates and stores a cryptographic commitment representing a set of data, receives a query from a prover device, and returns a success flag indicating whether the prover's response matches the expected data. The verifier operates separately from the prover devices, ensuring an unbiased and secure verification process. The commitment is a cryptographic hash or similar construct that binds the data to a fixed value, allowing the verifier to later confirm that the prover's response corresponds to the original data without revealing the data itself. The system is designed to enhance privacy and security in distributed systems, such as blockchain networks or federated databases, where multiple parties need to verify data without direct access to the underlying information. The verifier's independence from the prover devices prevents tampering and ensures that the verification process remains trustworthy. This approach is particularly useful in scenarios requiring non-repudiation and tamper-proof data validation.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
August 26, 2022
December 13, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.