Block #563,660

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.

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

12765406817833456617…68878246988816302081

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

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

12765406817833456617…68878246988816302081

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

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

25530813635666913235…37756493977632604161

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

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

51061627271333826471…75512987955265208321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

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

10212325454266765294…51025975910530416641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

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

20424650908533530588…02051951821060833281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

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

40849301817067061177…04103903642121666561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

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

81698603634134122354…08207807284243333121

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

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

16339720726826824470…16415614568486666241

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

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

32679441453653648941…32831229136973332481

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

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

65358882907307297883…65662458273946664961

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