费马大定理与模运算：有限空间有效性及智能合约技术问询

Great question—this ties number theory, modular arithmetic, and smart contract security together in a super practical, eye-opening way. Let’s break down your two core questions clearly:

1. 费马大定理在有限空间中是否始终不成立？ #

Short answer: Absolutely not. Fermat’s Last Theorem (FLT) states that there are no positive integers (a, b, c) such that (a^n + b^n = c^n) for any integer (n > 2)—but this only holds in the infinite domain of integers.

In finite spaces (like modulo (2^{256}), the underlying arithmetic for Solidity’s int256/uint256), the rules of number theory shift dramatically:

• Finite spaces have a fixed number of elements, so operations wrap around (overflow/underflow) instead of growing infinitely.
• Equations that have no solutions in infinite integers can have many solutions in finite modular spaces.

For example, take modulo 7 (a small finite prime field) and (n=3):
(3^3 + 4^3 = 27 + 64 = 91), and (91 \equiv 0 \pmod{7}). Since (0 = 0^3), we get a valid solution: (3^3 + 4^3 = 0^3 \pmod{7}).

For modulo (2^{256}), the same logic applies. There are countless triples ((a, b, c)) that satisfy (a^n + b^n \equiv c^n \pmod{2^{256}}) for (n > 2)—FLT simply doesn’t apply here.

2. 该现象与模运算、智能合约安全性的关联 #

This is where the rubber meets the road for smart contract developers. Let’s connect the dots:

• Modular arithmetic is non-negotiable in smart contracts: Solidity’s int256 and uint256 types don’t represent infinite integers—they operate in a finite ring modulo (2^{256}). Any overflow or underflow automatically wraps around to fit within this space (even with Solidity’s overflow checks, the underlying math is still modular).
• Misapplying infinite-domain math leads to critical vulnerabilities: The contract you mentioned relied on FLT’s infinite-domain truth to make funds "unredeemable"—the developer assumed no one could find (a, b, c) for (n > 2). But since the contract uses int256 (mod (2^{256})), attackers can easily find valid modular solutions to bypass the restriction.
• Example attack vectors:
  • Trivial solution: Set (a = b = 2^{85}) and (n=3). Then (a^3 + b^3 = 2*(2^{85})3 = 2^{256} \equiv 0 \pmod{2^{256}}), so (c=0) satisfies the equation.
  • Non-trivial solutions: Using properties of modular exponentiation, you can find triples where (a, b, c) are non-zero. For instance, leveraging the fact that odd numbers modulo (2^{256}) have cyclic multiplicative orders, you can construct solutions by matching exponent residues.

The key takeaway: Never assume mathematical theorems from infinite domains translate directly to the finite modular spaces used in smart contracts. Always verify how your contract’s arithmetic behaves under modulo operations.

内容的提问来源于stack exchange，提问作者Sentient