Block #560,664

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

6.496 × 10⁹⁹(100-digit number)

64961435396691749245…18268190182379192321

Discovered Prime Numbers

p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

origin + 1

6.496 × 10⁹⁹(100-digit number)

64961435396691749245…18268190182379192321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

1.299 × 10¹⁰⁰(101-digit number)

12992287079338349849…36536380364758384641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

2.598 × 10¹⁰⁰(101-digit number)

25984574158676699698…73072760729516769281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

5.196 × 10¹⁰⁰(101-digit number)

51969148317353399396…46145521459033538561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

1.039 × 10¹⁰¹(102-digit number)

10393829663470679879…92291042918067077121

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

2.078 × 10¹⁰¹(102-digit number)

20787659326941359758…84582085836134154241

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

4.157 × 10¹⁰¹(102-digit number)

41575318653882719517…69164171672268308481

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

8.315 × 10¹⁰¹(102-digit number)

83150637307765439034…38328343344536616961

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

1.663 × 10¹⁰²(103-digit number)

16630127461553087806…76656686689073233921

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

3.326 × 10¹⁰²(103-digit number)

33260254923106175613…53313373378146467841

Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆

Rarity

UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)

Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …

Cross-reference on Chainz Explorer