Block #526,761

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.

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

48914146281411806913…10603467198572892161

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

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

48914146281411806913…10603467198572892161

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

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

97828292562823613826…21206934397145784321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

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

19565658512564722765…42413868794291568641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

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

39131317025129445530…84827737588583137281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

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

78262634050258891061…69655475177166274561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

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

15652526810051778212…39310950354332549121

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

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

31305053620103556424…78621900708665098241

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

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

62610107240207112849…57243801417330196481

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

1.252 × 10¹⁰³(104-digit number)

12522021448041422569…14487602834660392961

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

2.504 × 10¹⁰³(104-digit number)

25044042896082845139…28975205669320785921

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