US 12,608,704 B2Granted

Method of contracting reserves with single transaction in response to a plurality of contract requests

AssigneeZkrypto Inc.

InventorHyunok Oh

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present invention relates to a reserve contract method for generating single transaction in response to a plurality of contract requests. The reserve contract method, performed by at least one processor, includes receiving a plurality of contract requests for a plurality of reserves; obtaining a mid-large commit value based on the plurality of reserves and a plurality of random values using a verify key; generating a hash value based on the mid-large commit value; generating a large reserve value from the plurality of reserves based on the hash value; generating a large random value based on the plurality of random values based on the hash value; obtaining an proof value using the mid-large commit value, the large reserve value, and the large random value using a zero-knowledge proof algorithm; and transmitting the proof value as a transaction. The mid-large commit value has a Pedersen commitment format.

Claims10

Dependent claims

A reserve contract method performed by at least one processor, the reserve contract method comprising:

receiving a plurality of contract requests for a plurality of reserves;
obtaining, using a verify key, an aggregated commit value by aggregating the plurality of reserves and a plurality of random values;
generating a hash value γ based on the aggregated commit value;
generating an aggregated reserve value by aggregating the plurality of reserves based on the hash value γ;
generating an aggregated random value by aggregating the plurality of random values based on the hash value γ;
obtaining, using zk-SNARK, a proof value using the aggregated commit value, the aggregated reserve value, and the aggregated random value;
transmitting the proof value as a transaction, and
depositing the plurality of reserves to corresponding accounts using the proof value in response to the plurality of contract requests,
wherein the aggregated commit value has a Pedersen commitment format,
wherein the generating the aggregated reserve value from the plurality of reserves comprises:
exponentiating the hash value γ to a first index binary, which sequentially increases according to an order of the plurality of reserves, for each of the plurality of reserves;
and
obtaining the aggregated reserve value by multiplying each of the plurality of reserves by the exponentiated hash value γ using a tree structure,
wherein the plurality of reserves comprises a first reserve m0, a second reserve m1, a third reserve m2, and a fourth reserve m3,
wherein the aggregated reserve value with respect to the hash value γ is generated based on the following equation:
M
=
m
0
+
γ
·
m
1
+
γ
2
·
m
2
+
(
γ
+
γ
2
)
·
m
3
.

38 more elements

A reserve contract method performed by at least one processor, the reserve contract method comprising:

receiving a transaction corresponding to a plurality of contract requests;
obtaining a hash value γ using an aggregated commit value, which is obtained by aggregating a plurality of reserves and a plurality of random values, included in the transaction;
obtaining a first commit value using the hash value γ;
obtaining a second commit value using the hash value γ;
obtaining a third commit value based on the first commit value, the aggregated commit value, and the second commit value;
verifying an integrity of the third commit value using zk-SNARK;
updating a commit value list using a plurality of commit values included in the transaction when the integrity is verified;
and
depositing the plurality of reserves, each corresponding to the plurality of contract requests, to corresponding accounts using the plurality of commit values,
wherein the obtaining the second commit value using the hash value γ comprises:
obtaining the plurality of commit values from the transaction;
exponentiating the hash value γ to a first index binary, which sequentially increases according to an order of the plurality of commit values, for each of the plurality of commit values;
and
obtaining, using a tree structure, the second commit value by exponentiating each of the plurality of commit values to the exponentiated hash value γ,
wherein the plurality of commit values comprises a fourth commit value cm0, a fifth commit value cm1, a sixth commit value cm2, and a seventh commit value cm3,
wherein the second commit value, with respect to the hash value γ, is generated based on the following equation:
CM
low
=
cm
0
·
cm
1
γ
·
cm
2
γ
2
·
cm
3
(
γ
+
γ
2
)
.

37 more elements

Dependencies are inferred from the claim text.

Facts

Application: 18/391,635Filed 20 Dec 2023
Published: US 2025/0209449 A126 Jun 2025
Granted: 21 Apr 2026
Term ends: Not estimatedThe source records don’t support an estimate.

Classification8 codes

G06Q 20/3827
Insuring higher security of transaction: use of message hashing
G06Q 20/3829
Insuring higher security of transaction: involving key management
G06Q 20/401
Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check…:…
H04L 9/3218
Including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity…: using…