Block #2,289,322

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/9/2017, 2:02:27 PM · Difficulty 10.9554 · 4,555,876 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b0222cafca2808ee9877d81a2364f1debd8507882a50376eb28eedb8c13e8431

Height

#2,289,322

Difficulty

10.955416

Transactions

6

Size

2.16 KB

Version

2

Bits

0af49627

Nonce

693,178,331

Timestamp

9/9/2017, 2:02:27 PM

Confirmations

4,555,876

Merkle Root

93bed25e67f60ed4e220d89cbfeb746f91cba8c0182f307693a76d2ef8311b92
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.431 × 10⁹⁶(97-digit number)
34315411005708555984…89527521418731376641
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.431 × 10⁹⁶(97-digit number)
34315411005708555984…89527521418731376641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.863 × 10⁹⁶(97-digit number)
68630822011417111969…79055042837462753281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.372 × 10⁹⁷(98-digit number)
13726164402283422393…58110085674925506561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.745 × 10⁹⁷(98-digit number)
27452328804566844787…16220171349851013121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.490 × 10⁹⁷(98-digit number)
54904657609133689575…32440342699702026241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.098 × 10⁹⁸(99-digit number)
10980931521826737915…64880685399404052481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.196 × 10⁹⁸(99-digit number)
21961863043653475830…29761370798808104961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.392 × 10⁹⁸(99-digit number)
43923726087306951660…59522741597616209921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.784 × 10⁹⁸(99-digit number)
87847452174613903320…19045483195232419841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.756 × 10⁹⁹(100-digit number)
17569490434922780664…38090966390464839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.513 × 10⁹⁹(100-digit number)
35138980869845561328…76181932780929679361
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:58,006,016 XPM·at block #6,845,197 · 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