Block #556,834

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2014, 1:27:33 PM · Difficulty 10.9626 · 6,251,279 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d47dd94ba3dcc1b92ce9b0e409b9f1e0135f9da4933743ebab439bcda1d9ad6

Height

#556,834

Difficulty

10.962635

Transactions

6

Size

1.45 KB

Version

2

Bits

0af66f3b

Nonce

275,284,803

Timestamp

5/22/2014, 1:27:33 PM

Confirmations

6,251,279

Merkle Root

42526aaa722763fdb521d31c67912a9d4faa375c388125278184a0b4973bf180
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.

4.468 × 10⁹⁸(99-digit number)
44680771178040138457…89140036921751891199
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
4.468 × 10⁹⁸(99-digit number)
44680771178040138457…89140036921751891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.936 × 10⁹⁸(99-digit number)
89361542356080276915…78280073843503782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.787 × 10⁹⁹(100-digit number)
17872308471216055383…56560147687007564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.574 × 10⁹⁹(100-digit number)
35744616942432110766…13120295374015129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.148 × 10⁹⁹(100-digit number)
71489233884864221532…26240590748030259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.429 × 10¹⁰⁰(101-digit number)
14297846776972844306…52481181496060518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.859 × 10¹⁰⁰(101-digit number)
28595693553945688612…04962362992121036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.719 × 10¹⁰⁰(101-digit number)
57191387107891377225…09924725984242073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.143 × 10¹⁰¹(102-digit number)
11438277421578275445…19849451968484147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.287 × 10¹⁰¹(102-digit number)
22876554843156550890…39698903936968294399
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,708,952 XPM·at block #6,808,112 · 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