Block #2,645,281

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 8:28:37 PM · Difficulty 11.7288 · 4,187,464 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f32a3021b3e8b9c2d3c7c726d5d1b9e877a4c1ee077d36af731a6d6d1a62a95

Height

#2,645,281

Difficulty

11.728775

Transactions

9

Size

2.38 KB

Version

2

Bits

0bba9106

Nonce

180,399,963

Timestamp

5/2/2018, 8:28:37 PM

Confirmations

4,187,464

Merkle Root

f2c741379a5e0dabc645473df3614b1220b8003f340d9ed1f12bdb06e78d3b6b
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.598 × 10⁹⁵(96-digit number)
15982365381576942386…35200945831898792641
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.598 × 10⁹⁵(96-digit number)
15982365381576942386…35200945831898792641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.196 × 10⁹⁵(96-digit number)
31964730763153884773…70401891663797585281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.392 × 10⁹⁵(96-digit number)
63929461526307769546…40803783327595170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.278 × 10⁹⁶(97-digit number)
12785892305261553909…81607566655190341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.557 × 10⁹⁶(97-digit number)
25571784610523107818…63215133310380682241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.114 × 10⁹⁶(97-digit number)
51143569221046215636…26430266620761364481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.022 × 10⁹⁷(98-digit number)
10228713844209243127…52860533241522728961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.045 × 10⁹⁷(98-digit number)
20457427688418486254…05721066483045457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.091 × 10⁹⁷(98-digit number)
40914855376836972509…11442132966090915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.182 × 10⁹⁷(98-digit number)
81829710753673945019…22884265932181831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.636 × 10⁹⁸(99-digit number)
16365942150734789003…45768531864363663361
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,906,120 XPM·at block #6,832,744 · 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