Block #2,214,404

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2017, 4:56:22 AM · Difficulty 10.9439 · 4,629,441 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b82f0d54ac172245443bceaf1e269494576f700d4433417fef06c6516d143443

Height

#2,214,404

Difficulty

10.943858

Transactions

2

Size

424 B

Version

2

Bits

0af1a0a8

Nonce

232,373,929

Timestamp

7/20/2017, 4:56:22 AM

Confirmations

4,629,441

Merkle Root

f1d44b10de92ca1e05e5dbaccf72722cf883bc6929bb1d213a0ec89e2d6b5bee
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.

3.937 × 10⁹²(93-digit number)
39378014237992398088…30530794343630644441
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
3.937 × 10⁹²(93-digit number)
39378014237992398088…30530794343630644441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.875 × 10⁹²(93-digit number)
78756028475984796176…61061588687261288881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.575 × 10⁹³(94-digit number)
15751205695196959235…22123177374522577761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.150 × 10⁹³(94-digit number)
31502411390393918470…44246354749045155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.300 × 10⁹³(94-digit number)
63004822780787836940…88492709498090311041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.260 × 10⁹⁴(95-digit number)
12600964556157567388…76985418996180622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.520 × 10⁹⁴(95-digit number)
25201929112315134776…53970837992361244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.040 × 10⁹⁴(95-digit number)
50403858224630269552…07941675984722488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.008 × 10⁹⁵(96-digit number)
10080771644926053910…15883351969444976641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.016 × 10⁹⁵(96-digit number)
20161543289852107821…31766703938889953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.032 × 10⁹⁵(96-digit number)
40323086579704215642…63533407877779906561
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,995,127 XPM·at block #6,843,844 · 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