Block #2,645,683

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 12:36:16 AM · Difficulty 11.7370 · 4,185,494 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8ccd6209c9a746017f487da035731d3960b2af6d070e63e6c4a071eb4c4b4a7

Height

#2,645,683

Difficulty

11.736962

Transactions

71

Size

20.69 KB

Version

2

Bits

0bbca989

Nonce

1,754,420,435

Timestamp

5/3/2018, 12:36:16 AM

Confirmations

4,185,494

Merkle Root

eed82655bef77d906edefe3668e22f8c384c87fc92716c5d39237bdb8b4a6b28
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.900 × 10⁹⁴(95-digit number)
39007269941398056315…27471491201828915201
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.900 × 10⁹⁴(95-digit number)
39007269941398056315…27471491201828915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.801 × 10⁹⁴(95-digit number)
78014539882796112631…54942982403657830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.560 × 10⁹⁵(96-digit number)
15602907976559222526…09885964807315660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.120 × 10⁹⁵(96-digit number)
31205815953118445052…19771929614631321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.241 × 10⁹⁵(96-digit number)
62411631906236890105…39543859229262643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.248 × 10⁹⁶(97-digit number)
12482326381247378021…79087718458525286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.496 × 10⁹⁶(97-digit number)
24964652762494756042…58175436917050572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.992 × 10⁹⁶(97-digit number)
49929305524989512084…16350873834101145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.985 × 10⁹⁶(97-digit number)
99858611049979024168…32701747668202291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.997 × 10⁹⁷(98-digit number)
19971722209995804833…65403495336404582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.994 × 10⁹⁷(98-digit number)
39943444419991609667…30806990672809164801
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,893,558 XPM·at block #6,831,176 · 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