Nash is new evidence for Satoshi Nakamoto. Nash's summary of cryptography research: - Peer-to-peer public-private key accounts are established based on information asymmetry. The signer has more information than the verifier. - Peer-to-peer transactions and the establishment of double-spend attacks come from computational asymmetry. The difficulty adjustment of the double hash nonce follows the principle of being hard to compute but easy to verify. Generating it requires tens of millions of collisions, while verification only needs one collision. Meanwhile, BTC's consensus mechanism must achieve information symmetry to reach the unique convergence of Nash equilibrium. Other BFT/PoS consensus mechanisms are alliance game mechanisms based on information asymmetry. Only on the basis of information symmetry can the Nash equilibrium of non-cooperative games converge. So, under the condition of information symmetry, how do you prevent double-spend attacks? That is, without relying on any third-party trust mechanism for arbitration. This introduces computational asymmetry: the tens of millions of solutions required for nonce collisions versus the single collision needed for verification. This asymmetry ensures the security of Satoshi Nakamoto's consensus mechanism.