Block #503,226

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 11:16:46 PM · Difficulty 10.8079 · 6,306,236 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
4959a71f5af787d293b08435a273032de60db1bdd3830a0ce4fb7581ec77ca71

Height

#503,226

Difficulty

10.807851

Transactions

11

Size

3.57 KB

Version

2

Bits

0acecf4f

Nonce

192,297,643

Timestamp

4/20/2014, 11:16:46 PM

Confirmations

6,306,236

Merkle Root

5a7d13e79d84dbf8f8bffa1c5de53e9ecbb63797d888d21b1f7bf9781f4f240c
Prime Chain Origin

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.253 × 10⁹⁸(99-digit number)
12530819910498822504…68270124264678946961
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.

1
origin + 1
1.253 × 10⁹⁸(99-digit number)
12530819910498822504…68270124264678946961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.506 × 10⁹⁸(99-digit number)
25061639820997645008…36540248529357893921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.012 × 10⁹⁸(99-digit number)
50123279641995290016…73080497058715787841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.002 × 10⁹⁹(100-digit number)
10024655928399058003…46160994117431575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.004 × 10⁹⁹(100-digit number)
20049311856798116006…92321988234863151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.009 × 10⁹⁹(100-digit number)
40098623713596232012…84643976469726302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.019 × 10⁹⁹(100-digit number)
80197247427192464025…69287952939452605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.603 × 10¹⁰⁰(101-digit number)
16039449485438492805…38575905878905210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.207 × 10¹⁰⁰(101-digit number)
32078898970876985610…77151811757810421761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.415 × 10¹⁰⁰(101-digit number)
64157797941753971220…54303623515620843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.283 × 10¹⁰¹(102-digit number)
12831559588350794244…08607247031241687041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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, …
Circulating Supply:57,719,766 XPM·at block #6,809,461 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy