Block #2,185,073

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/29/2017, 6:08:11 PM · Difficulty 10.9442 · 4,632,793 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f88e19d7397a5ccecf2d2aec4401ba6d954268f4803973e1c4eb03815edd0ca8

Height

#2,185,073

Difficulty

10.944171

Transactions

5

Size

1.73 KB

Version

2

Bits

0af1b536

Nonce

1,011,344,114

Timestamp

6/29/2017, 6:08:11 PM

Confirmations

4,632,793

Merkle Root

2d24ab8c75781b994faeec445515264c9e37d7ff6c5db10b028ded7c7358a3a8
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.489 × 10⁹⁶(97-digit number)
24893619552981077177…23016951512544517121
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.489 × 10⁹⁶(97-digit number)
24893619552981077177…23016951512544517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.978 × 10⁹⁶(97-digit number)
49787239105962154354…46033903025089034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.957 × 10⁹⁶(97-digit number)
99574478211924308708…92067806050178068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.991 × 10⁹⁷(98-digit number)
19914895642384861741…84135612100356136961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.982 × 10⁹⁷(98-digit number)
39829791284769723483…68271224200712273921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.965 × 10⁹⁷(98-digit number)
79659582569539446967…36542448401424547841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.593 × 10⁹⁸(99-digit number)
15931916513907889393…73084896802849095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.186 × 10⁹⁸(99-digit number)
31863833027815778786…46169793605698191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.372 × 10⁹⁸(99-digit number)
63727666055631557573…92339587211396382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.274 × 10⁹⁹(100-digit number)
12745533211126311514…84679174422792765441
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,786,995 XPM·at block #6,817,865 · 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