CPC G06Q 20/401 (2013.01) [G06F 16/2379 (2019.01); G06Q 10/10 (2013.01); G06Q 20/065 (2013.01); G06Q 20/0658 (2013.01); G06Q 20/3674 (2013.01); G06Q 20/3827 (2013.01); H04L 9/0637 (2013.01); H04L 9/0643 (2013.01); H04L 9/0662 (2013.01); H04L 9/3247 (2013.01); G06Q 2220/00 (2013.01); H04L 9/50 (2022.05)] | 16 Claims |
1. A computer-implemented method comprising:
validating, by one or more network nodes having one or more processors, a third transaction that includes, in a third locking script, a first puzzle, a second puzzle, and a pseudorandom number generator (PRNG), wherein solutions to the first and second puzzles are not known or fixed at a time that the third locking script is created, wherein:
the first puzzle is included, in a first transaction, in a first locking script that encumbers, with a first condition fulfillable by a solution to the first puzzle, transfer of control of a first digital asset, wherein the first transaction is created by a first party;
the second puzzle is included, in a second transaction, in a second locking script that encumbers, with a second condition fulfillable by a solution to the second puzzle, transfer of control of a second digital asset, wherein the second transaction is created by a second party different from the first party;
the first transaction and the second transaction are committed to a blockchain; and
the third transaction is associated with a third digital asset;
obtaining a fourth transaction that includes, in an unlocking script, solutions to the first and second puzzles;
generating, by the PRNG, a pseudorandom number by executing the unlocking script and the third locking script, wherein a pseudorandom seed is derived from the solutions and input into the PRNG; and
transferring control of the third digital asset based at least in part on the pseudorandom number.
|