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, as filed with the USPTO.
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.
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.
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.
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.
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.
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.
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.
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).
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.
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.
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.
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.
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.