Quantum-based distributed ledger

1 . A distributed ledger computer program product, the computer program product comprising executable instructions stored on non-transitory memory of a computer system that comprises a standard processor and an “N”-qubit processor, the executable instructions when executed by the computer system:

receive a request to add data to a distributed ledger from a user;

solve one or more algorithmic problems using the “N”-qubit processor;

receive a solution to the one or more algorithmic problems;

determine that the solution is correct;

transmit one or more fungible tokens to the user;

receive compensation from the user;

when the solution is correct and compensation is received from the user, record the data on the distributed ledger; and

propagate the data to every computer system running the distributed ledger;

wherein:

the one or more algorithmic problems cannot be solved using the standard processor;

the one or more algorithmic problems are selected from a set of algorithmic problems defined as Q-QS;

wherein:

Q is a universe of algorithmic problems solvable by the “N”-qubit processor; and

QS is a subset of Q solvable by the standard processor and the “N”-qubit processor; and

“N” is a number between two and one thousand.

2 . The distributed ledger computer program product of claim 1 wherein the one or more algorithmic problems cannot be solved using the standard processor within a pre-determined length of time.

3 . The distributed ledger computer program product of claim 2 wherein the pre-determined time is one year.

4 . The distributed ledger computer program product of claim 2 wherein the pre-determined length of time is variable.

5 . The distributed ledger computer program product of claim 1 wherein the distributed ledger is a blockchain.

6 . The distributed ledger computer program product of claim 4 wherein the pre-determined length of time is varied by one or more AI/ML algorithms.

7 . The distributed ledger computer program product of claim 1 wherein the one or more algorithmic problems are adjusted after an analysis of a length of time the distributed ledger is active.

8 . The distributed ledger computer program product of claim 7 wherein the length of time is one week.

9 . The distributed ledger computer program product of claim 7 wherein the analysis analyzes the number of fungible tokens transmitted during the length of time.

10 . The distributed ledger computer program product of claim 9 wherein when the analysis determines that too many fungible tokens were transmitted, the one or more algorithmic problems are made more difficult to solve.

11 . The distributed ledger computer program product of claim 1 wherein the compensation is a portion of the one or more fungible tokens.

12 . The distributed ledger computer program product of claim 1 wherein the compensation is one of the one or more fungible tokens.

13 . The distributed ledger computer program product of claim 1 wherein the one or more fungible tokens are stored in a digital wallet belonging to the user.

14 . The distributed ledger computer program product of claim 1 wherein one of the one or more fungible tokens is an authentication token.

15 . The distributed ledger computer program product of claim 14 wherein only users with one or more authentication tokens are permitted to add data to the distributed ledger.

16 . The distributed ledger computer program product of claim 1 wherein the distributed ledger is encrypted with a quantum-resistant encryption.

17 . The distributed ledger computer program product of claim 16 wherein the quantum-resistant encryption comprises one or more of the following:

cryptographic suite for algebraic lattices (CRYSTALS)-Dilithium;

fast-Fourier lattice-based compact signatures over N-th degree truncated polynomial ring units (NTRU) (FALCON); or

a stateless hash-based signature scheme known as SPHINCS+.

18 . An apparatus for a distributed ledger using quantum computing, the apparatus comprising:

two or more computer systems, each computer system comprising:

a communication link;

a micro-processor;

an “N”-qubit processor; and

a non-transitory memory configured to store at least:

an operating system; and

a distributed ledger application;

wherein the distributed ledger application:

receives a request to add data to a distributed ledger from a user;

requires the user to solve one or more algorithmic problems using the “N”-qubit processor;

receives a solution to the one or more algorithmic problems;

determines that the solution is correct;

transmits one or more fungible tokens to the user;

receives compensation from the user;

when the solution is correct and compensation is received from the user, records the data on the distributed ledger; and

propagates the data to every computer system running the distributed ledger; and

wherein:

the one or more algorithmic problems cannot be solved using the micro-processor;

the one or more algorithmic problems are selected from a set of algorithmic problems defined as Q-QS;

wherein:

Q is a universe of algorithmic problems solvable by the “N”-qubit processor; and

QS is a subset of Q solvable by the standard processor and the “N”-qubit processor; and

“N” is a number between two and one thousand.

19 . A method for quantum-based distributed ledger, the method comprising the steps of:

receiving, at a distributed ledger computer program running on a computer system comprising a standard processor and an “N”-qubit processor, a request to add data to a distributed ledger from a user;

solving one or more algorithmic problems from a set of algorithmic problems defined as Q-QS using the “N”-qubit processor;

receiving a solution to the one or more algorithmic problems;

determining that the solution is correct;

when the solution is correct, transmitting one or more fungible tokens to the user;

receiving compensation from the user; and

when the solution is correct and compensation is received from the user:

recording the data on the distributed ledger; and

propagating the data to every computer system running the distributed ledger;

wherein:

Q is a universe of algorithmic problems solvable by the “N”-qubit processor;

QS is a subset of Q solvable by the standard processor and the “N”-qubit processor; and

“N” is a number between two and one thousand.