Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer readable media, and transaction nodes are disclosed that update a cryptographic commitment to a data blob (e.g., Structured Query Language (SQL) database table or block of transactions) with respect to data to be inserted into the data blob and ingested via communication network(s) from a data source. The updated cryptographic commitment is then stored in a distributed ledger replicated at each of the transaction nodes upon obtaining agreement on the updated cryptographic commitment with one or more of the transaction nodes based on a consensus protocol. The ingested data is inserted (e.g., by one of the transaction nodes or directly by a data source) in the data blob in a data store (e.g., a SQL database or blockchain). By maintaining redundant copies of a ledger of cryptographic commitments across transaction nodes, this technology facilitates query verification with improved scalability, efficiency, and security, among other advantages.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer-readable media, and query verification apparatuses are disclosed that receive a result vector, an index to the result vector, a range proof, and an inner product proof from a prover device after providing a query vector to the prover device. The prover device hosts a vector database with rows and columns. Second and third commitments to a distance vector and a random linear combination vector, respectively, are generated based on a first commitment to the rows. The range proof is checked using the second commitment and the inner product proof is checked using the third commitment and a generator used to generate the first commitment and identified based on the index. The result vector is returned after confirming that it is one of the rows and each of the rows is as far from the query vector as the result vector based on the check of the proofs.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer-readable media, and query verification apparatuses are disclosed that receive a result vector, an index to the result vector, a range proof, and an inner product proof from a prover device after providing a query vector to the prover device. The prover device hosts a vector database with rows and columns. Second and third commitments to a distance vector and a random linear combination vector, respectively, are generated based on a first commitment to the rows. The range proof is checked using the second commitment and the inner product proof is checked using the third commitment and a generator used to generate the first commitment and identified based on the index. The result vector is returned after confirming that it is one of the rows and each of the rows is as far from the query vector as the result vector based on the check of the proofs.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.

Abstract: 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.

Abstract: A method, apparatus and system for transforming genomic data into a computer database environment comprising a forward lookup table and a plurality of reverse lookup tables which relate consecutive overlapping reference sequence segments to reference sequences stored in the forward lookup table enables rapid and precise matching of undefined biological sequences with reference sequences.

Abstract: A flange joint system for SRF cavities. The flange joint system includes a set of high force spring clamps that produce high force on the simple flanges of Superconducting Radio Frequency (SRF) cavities to squeeze conventional metallic seals. The system establishes the required vacuum and RF-tight seal with minimum particle contamination to the inside of the cavity assembly. The spring clamps are designed to stay within their elastic range while being forced open enough to mount over the flange pair. Upon release, the clamps have enough force to plastically deform metallic seal surfaces and continue to a new equilibrium sprung dimension where the flanges remain held against one another with enough preload such that normal handling will not break the seal.

Abstract: A method, apparatus and system for transforming genomic data into a computer database environment comprising a forward lookup table and a plurality of reverse lookup tables which relate consecutive overlapping reference sequence segments to reference sequences stored in the forward lookup table enables rapid and precise matching of undefined biological sequences with reference sequences.

Abstract: A method, apparatus and system for transforming genomic data into a computer database environment comprising a forward lookup table and a plurality of reverse lookup tables which relate consecutive overlapping reference sequence segments to reference sequences stored in the forward lookup table enables rapid and precise matching of undefined biological sequences with reference sequences.

Abstract: A flange joint system for SRF cavities. The flange joint system includes a set of high force spring clamps that produce high force on the simple flanges of Superconducting Radio Frequency (SRF) cavities to squeeze conventional metallic seals. The system establishes the required vacuum and RF-tight seal with minimum particle contamination to the inside of the cavity assembly. The spring clamps are designed to stay within their elastic range while being forced open enough to mount over the flange pair. Upon release, the clamps have enough force to plastically deform metallic seal surfaces and continue to a new equilibrium sprung dimension where the flanges remain held against one another with enough preload such that normal handling will not break the seal.

Abstract: A method, apparatus and system for transforming genomic data into a computer database environment comprising a forward lookup table and a plurality of reverse lookup tables which relate consecutive overlapping reference sequence segments to reference sequences stored in the forward lookup table enables rapid and precise matching of undefined biological sequences with reference sequences.

Abstract: A sensor calibration device and method of construction for a force variation machine includes a circular plate having a test measurement region defined thereon. The test measurement region has a circumferentially extending inner track and a circumferentially extending outer track, the outer track having a projection and a valley for sidewall bulge and valley simulation formed therein and the inner track having a first and a second step formed therein separating the inner track into outward and inward inner track portions. A circumferentially extending radial edge track is provided having a first and a second step formed therein separating the edge track into outward and inward edge track portions. The projection and valley on the outer track have a depth equivalent to tire sidewall bulge and valley limits, respectively. The first and second steps in the inner track have a depth equivalent to a tire lateral run-out limit.

Abstract: A sensor calibration device and method of construction for a force variation machine includes a circular plate having a test measurement region defined thereon. The test measurement region has a circumferentially extending inner track and a circumferentially extending outer track, the outer track having a projection and a valley for sidewall bulge and valley simultion formed therein and the inner track having a first and a second step formed therein separating the inner track into outward and inward inner track portions. A circumferentially extending radial edge track is provided having a first and a second step formed therein separating the edge track into outward and inward edge track portions. The projection and valley on the outer track have a depth equivalent to tire sidewall bulge and valley limits, respectively. The first and second steps in the inner track have a depth equivalent to a tire lateral run-out limit.