BitMint*LeVeL: decentralized mathematics digital coin * quantum safe, robust anonymity

A method for payment of digital money involving a Mint, r money trader computing devices:

• Tr1, Tr2, . . . Trr, and a digital coin X denominated for a value x=|X| expressed in a trusted currency C, the method comprising:
• minting X, by the Mint, and passing the minted X to Tr1, against a payment of x paid by Tr1 to the Mint;
• passing X, by Tr1 to Tr2, and so on by order Tri to Tri+1 to Trr;
• redeeming X, by Trr, with the Mint against an amount x paid by the Mint to Trr;
• selecting, by each trader computing device:
• Tri, for i=1, 2, . . . r, their own public/private key formula, Fui, and their own private key Ui;
• computing, by each trader computing device:
• Tri, for i=1, 2, . . . r, their own public key U*i=Fui(Ui), making U*I and Fui public;
• constructing, by the Mint, a public ledger listing X and a chain of its holders up to the present when Tri is the current holder of X, the public ledger listing is as follows:
• [X][t0][U*1][Fu1][t1][U*2][Fu2] . . . [ti−1][U*i][Fui]
• wherein t0 is a time that X was minted, and tj for j=1, 2, . . . (i−1) is the time Trj passed X to Trj+1;
• and wherein the method further comprises a payment procedure of X, from trader computing device Tri to trader computing device Tri+1, comprising
• (i) Submitting, by Tri to Tri+1, the i values:
• U1 U2, . . . Ui,
• (ii) Verifying, by Tri+1, that Uk=Fuk(Uk) for k=1, 2, . . . i,
• (iii) determining that step (ii) results in positive verification of the i tests, and
• (iv) updating, by Tri+1, the listing of X in the public ledger to read:
• [X][t0][U*1][Fu1][t1][U*2][Fu2] . . . [ti−1][U*i][Fui][ti][U*i+1][Fui+1]
• and wherein the method further comprises a redeeming procedure of X to Tr comprising:
• (a) submitting, by Trr to the Mint, the r values:
• U1, U2, . . . Ur,
• (b) verifying, by the Mint, the following r tests:
• U*i=Fui(Ui) for i=1, 2, . . . r, and
• (c) redeeming, by the Mint, X to Trr based on the verifying.