Block #560,598

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2014, 10:15:43 PM · Difficulty 10.9653 · 6,248,735 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a9f34f9cfd457bee2c6d8f73f17035c789aadf4d9478ddfa59784840fcf819cf

Height

#560,598

Difficulty

10.965283

Transactions

4

Size

4.30 KB

Version

2

Bits

0af71cca

Nonce

29,548,512

Timestamp

5/24/2014, 10:15:43 PM

Confirmations

6,248,735

Merkle Root

0dff81997af20f7284150a605d78c84704219b0398fca7167febcf4dfd2c7cbc
Transactions (4)
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.

2.356 × 10⁹⁹(100-digit number)
23569631610409289238…96822873604850355199
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
2.356 × 10⁹⁹(100-digit number)
23569631610409289238…96822873604850355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.713 × 10⁹⁹(100-digit number)
47139263220818578476…93645747209700710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.427 × 10⁹⁹(100-digit number)
94278526441637156953…87291494419401420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.885 × 10¹⁰⁰(101-digit number)
18855705288327431390…74582988838802841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.771 × 10¹⁰⁰(101-digit number)
37711410576654862781…49165977677605683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.542 × 10¹⁰⁰(101-digit number)
75422821153309725562…98331955355211366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.508 × 10¹⁰¹(102-digit number)
15084564230661945112…96663910710422732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.016 × 10¹⁰¹(102-digit number)
30169128461323890225…93327821420845465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.033 × 10¹⁰¹(102-digit number)
60338256922647780450…86655642841690931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.206 × 10¹⁰²(103-digit number)
12067651384529556090…73311285683381862399
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,718,730 XPM·at block #6,809,332 · 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