The Relationship between Bitcoin Metatechnology and Fermat's Last Theorem The proof process of Fermat's Last Theorem: 1. Gushan Zhicun conjecture: elliptic curve equations are equivalent to modular forms. 2. Frye transformed Fermat's equation into an elliptic curve equation. 3. Ken Ribet proved the hidden Fermat's Last Theorem in the Taniyama Shimura conjecture. 4. Wiles began to prove the Tanisan Shimura conjecture and also proved Fermat's Last Theorem. 5. Wiles used Gaara's group theory to generalize and prove that the sequence of solutions to elliptic curve equations is equivalent to the sequence of modular solutions, and proved that a small part of each elliptic curve equation can be used to form a group. 6. Bonn and Gong Gang claimed to have proved the conjecture using differential geometry, but it was ultimately proven to be a failure. However, their proof element technique is consistent with Wiles': the philosophy of parallelism. Only Wiles used elliptic curve equations and modular forms. 7. Wiles applied Galois groups to elliptic curve equations and decomposed them into an infinite number of terms. He then proved that the first term of each elliptic curve equation must be the first term of the modular form. 8. Use the Kolwakin Fletcher method to extend the argument from the first term to all terms of the elliptic curve equation. In 1993, it was announced that Fermat's theorem had been proven, but there was a completeness issue with the final proof of infinite convergence. In 1994, relying on the Iwasawa theory mixed with the Kolwakin Fletcher method to complement each other perfectly, the Tanisan Shimura conjecture was proved, and Fermat's theorem was also proved. The Iwasawa theory complements the proof of convergence of the Kolwakin Fletcher method in the infinite direction. Solved the vulnerability in the 1993 proof version. The idea behind this proof of meta craftsmanship is called the Robert Langlands Program: Mathematics unifies one chain after another through the philosophy of parallelism. And Nash was inspired by the meta craftsmanship of proving Fermat's Last Theorem, thinking that he could mechanically complete the Lorentz program through a specific craftsmanship. The Process of Nash Thought Plan: Hierarchical Introspective Logic. -1. Turing machines are a fundamental computable formal theory that can solve recursive continuity problems. -2. Turing pursued a complete solution based on the Turing machine and designed his own Turing ordinal logic system: solving non computable (non recursive) problems by combining the superpoor iterations of the ordinals of the Turing machine and oracle machine. But there is a problem of non uniqueness/invariance, similar to the problem of Wiles proving Fermat's Last Theorem in 1993. -3. Nash used the definition of ordinal numbers (citation) to solve the problem of infinite solutions for each layer of ordinal numbers in Turing ordinal logic systems. But there still exist an infinite number of ordinal logical chains. -4. Use the idea of Nash equilibrium to strong solution in Nash non cooperative games to solve the problem of infinite ordinal logical chains converging to uniqueness. Instantiate Bitcoin using Nash's ideas: -1. Using Turing machine theory to implement BTC currency transaction business, leaving behind the double spending problem that cannot be solved by this theory. -2. Transform the double flower problem into a Block logic that iterates with block height as the ordinal through the theory of ordinal logic systems. -3. The definition of ordinal numbers was redefined using the Hash of Blocks, which means that each layer of a Blockchain has only one unique Block. -4. Use the non cooperative game mode of POW to determine the only strong solution: the heaviest chain. This is the complete metacraft of Bitcoin designed by Satoshi Nakamoto. It is also an iteration of the Hilbert Mathematics Complete Building inherited by mathematicians. Interestingly, G ö del used the incompleteness theorem to overturn Hilbert's mathematical completeness building. And Turing then used the Turing machine to empirically prove this mathematical completeness building. The proof of Fermat's Last Theorem, the decentralized mechanical operation of Bitcoin, and the Lorentz program seem to support Hilbert's mathematical completeness work (Wir m ü ssen wissen Wir werden wissen.). Nash made a philosophical assertion that mathematics and culture are both evolving. With the development of human civilization, all mathematical problems that were previously problematic can be fully proved by combining new technological theories.