Block #540,896

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2014, 7:37:34 AM · Difficulty 10.9363 · 6,276,255 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b862d77c80bda0804f19bb9214cd52ea8488b9c31c12779e3de45fafa1888043

Height

#540,896

Difficulty

10.936289

Transactions

4

Size

28.47 KB

Version

2

Bits

0aefb0a6

Nonce

144,330

Timestamp

5/13/2014, 7:37:34 AM

Confirmations

6,276,255

Merkle Root

19c915a4f565fd0367570e6b03b2bed965563c0d7805c389f6bd5bc41b43d247
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.413 × 10⁹⁷(98-digit number)
14130620159085652840…66960173274131910759
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.413 × 10⁹⁷(98-digit number)
14130620159085652840…66960173274131910759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.826 × 10⁹⁷(98-digit number)
28261240318171305680…33920346548263821519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.652 × 10⁹⁷(98-digit number)
56522480636342611361…67840693096527643039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.130 × 10⁹⁸(99-digit number)
11304496127268522272…35681386193055286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.260 × 10⁹⁸(99-digit number)
22608992254537044544…71362772386110572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.521 × 10⁹⁸(99-digit number)
45217984509074089089…42725544772221144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.043 × 10⁹⁸(99-digit number)
90435969018148178178…85451089544442288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.808 × 10⁹⁹(100-digit number)
18087193803629635635…70902179088884577279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.617 × 10⁹⁹(100-digit number)
36174387607259271271…41804358177769154559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.234 × 10⁹⁹(100-digit number)
72348775214518542542…83608716355538309119
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,781,244 XPM·at block #6,817,150 · 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.
Privacy Policy·

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