[Cryptography] Subject: Re: Prime-based proof-of-work and Nashian cooperative mining

[Ovanes Oganisian]

I wanted to follow up because I have now launched a public testnet 
implementation of the idea, with several changes from the earlier draft. 
The testnet name is MRPC: MidLincoln Research Prime Coin.

MRPC/Primechain now runs as an ordered integer-classification chain 
beginning at 2. Miners submit the next frontier integer only. Prime   
records carry Pratt-style primality certificates. Composite records 
carry divisor/cofactor evidence and pass through a validator-run lottery 
   gate; if the lottery loses, no composite record is accepted and the 
same frontier integer remains open. Validators provide quorum finality, 
   gossip, sync, transaction handling, wallet balance queries, and 
economic policy voting.

The wallet model has also changed. There is no headline integer. Wallet 
balances are sparse holdings over prime-indexed assets, denominated   in 
integer micro-units. All prime micro-units have equal MRPC value; the 
prime number is only an issuance label.

The current implementation specifies SHA3-256 commitments/hashing and 
ML-DSA-65 signatures. It is a testnet, not a claim of a finished   
cryptocurrency security proof. The main open questions are still Sybil 
resistance, long-term storage economics, incentive tuning, and client   UX.

   Whitepaper v2:
https://midlincoln.com/opportunities/prime-mining/launch-proof/prime-mining-whitepaper-v2.html

   Launch/proof page:
   https://midlincoln.com/opportunities/prime-mining/launch-proof/

   Repository:
   https://github.com/midlincoln/primechain

   Comments are welcome, especially on the validator/quorum model, the 
composite lottery gate, and the remaining incentive weaknesses.

   Kind regards,

   Ovanes Oganisian
   oovanes at midlincoln.com