Block #840,532

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2014, 5:40:55 AM · Difficulty 10.9742 · 5,970,365 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f0f0dfdf0bac5e1f11ca9bc2e00c58c693a9dc5474f7b6069d2cf7b6f41c726

Height

#840,532

Difficulty

10.974203

Transactions

4

Size

1.01 KB

Version

2

Bits

0af9655d

Nonce

1,590,637,054

Timestamp

12/5/2014, 5:40:55 AM

Confirmations

5,970,365

Merkle Root

73ea9ce14836cd9f4d5b831cecbf6da73569f1813d3d301bd0f3b521e130e71f
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.

5.581 × 10⁹⁶(97-digit number)
55814055006717853362…10015474952884664321
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
5.581 × 10⁹⁶(97-digit number)
55814055006717853362…10015474952884664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.116 × 10⁹⁷(98-digit number)
11162811001343570672…20030949905769328641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.232 × 10⁹⁷(98-digit number)
22325622002687141345…40061899811538657281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.465 × 10⁹⁷(98-digit number)
44651244005374282690…80123799623077314561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.930 × 10⁹⁷(98-digit number)
89302488010748565380…60247599246154629121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.786 × 10⁹⁸(99-digit number)
17860497602149713076…20495198492309258241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.572 × 10⁹⁸(99-digit number)
35720995204299426152…40990396984618516481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.144 × 10⁹⁸(99-digit number)
71441990408598852304…81980793969237032961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.428 × 10⁹⁹(100-digit number)
14288398081719770460…63961587938474065921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.857 × 10⁹⁹(100-digit number)
28576796163439540921…27923175876948131841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.715 × 10⁹⁹(100-digit number)
57153592326879081843…55846351753896263681
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,731,274 XPM·at block #6,810,896 · 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