Block #553,567

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/20/2014, 5:58:28 AM · Difficulty 10.9630 · 6,243,132 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
97a87453e39d8921cb66554bade37f05e41dc376388fb72e0387afb3a1ce63d9

Height

#553,567

Difficulty

10.962984

Transactions

2

Size

1.15 KB

Version

2

Bits

0af68624

Nonce

52,842,919

Timestamp

5/20/2014, 5:58:28 AM

Confirmations

6,243,132

Merkle Root

213b58255cca7649150dd4950e85fb03ac6e450b7a93cf3874939271fd977db3
Transactions (2)
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.

8.459 × 10⁹⁹(100-digit number)
84595296524119167607…83974259191037656319
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
8.459 × 10⁹⁹(100-digit number)
84595296524119167607…83974259191037656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.691 × 10¹⁰⁰(101-digit number)
16919059304823833521…67948518382075312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.383 × 10¹⁰⁰(101-digit number)
33838118609647667042…35897036764150625279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.767 × 10¹⁰⁰(101-digit number)
67676237219295334085…71794073528301250559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.353 × 10¹⁰¹(102-digit number)
13535247443859066817…43588147056602501119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.707 × 10¹⁰¹(102-digit number)
27070494887718133634…87176294113205002239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.414 × 10¹⁰¹(102-digit number)
54140989775436267268…74352588226410004479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.082 × 10¹⁰²(103-digit number)
10828197955087253453…48705176452820008959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.165 × 10¹⁰²(103-digit number)
21656395910174506907…97410352905640017919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.331 × 10¹⁰²(103-digit number)
43312791820349013814…94820705811280035839
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,617,600 XPM·at block #6,796,698 · 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.