US 12,231,568 B2
Algebraic proof-of-work algorithm for blockchains
Muslum Ozgur Ozmen, Tampa, FL (US); Rouzbeh Behnia, Tampa, FL (US); and Attila Altay Yavuz, Tampa, FL (US)
Assigned to University of South Florida, Tampa, FL (US)
Filed by University of South Florida, Tampa, FL (US)
Filed on Apr. 7, 2021, as Appl. No. 17/224,374.
Claims priority of provisional application 63/006,365, filed on Apr. 7, 2020.
Prior Publication US 2021/0314158 A1, Oct. 7, 2021
Int. Cl. H04L 9/32 (2006.01); G06F 17/16 (2006.01); H04L 9/00 (2022.01); H04L 9/30 (2006.01)
CPC H04L 9/3218 (2013.01) [G06F 17/16 (2013.01); H04L 9/3093 (2013.01); H04L 9/50 (2022.05)] 10 Claims
OG exemplary drawing
 
1. A computer-implemented method for providing a proof-of-work for a blockchain comprising:
receiving a cryptocurrency transaction request by a first computing device of a plurality of computing devices of a peer-to-peer blockchain network associated with the cryptocurrency; and
in response to receiving the cryptocurrency transaction request:
generating a block for a blockchain by the first computing device in the peer-to-peer blockchain network, wherein the block represents the cryptocurrency transaction request;
hashing the received block into a positive integer S and a list of positive integers (a1, a2, . . . , an) to create a shortest vector problem proof-of-work (PoW) by the first computing device;
solving the shortest vector problem PoW using a lattice sieving algorithm by the first computing device to generate a solution (∈1, ∈2, . . . , ∈n);
transmitting the block and the solution to each other computing device of the plurality of computing devices in the peer-to-peer blockchain network by the first computing device; and
in response to solving the shortest vector problem PoW, adding the block to the blockchain by the first computing device.