Block #2,235,208

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/3/2017, 2:00:29 PM · Difficulty 10.9456 · 4,608,321 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8eb7c7a02d0d7999a757892a59b46e4e87817a369764a3db991e74316e58478

Height

#2,235,208

Difficulty

10.945595

Transactions

3

Size

1.07 KB

Version

2

Bits

0af2127f

Nonce

463,635,235

Timestamp

8/3/2017, 2:00:29 PM

Confirmations

4,608,321

Merkle Root

11f907119b1aa4578a17cfd4af7398a2e9e8bd5c83207f85780b388835ef5e7e
Transactions (3)
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.

8.021 × 10⁹⁵(96-digit number)
80213704305089924302…17945453334264340481
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
8.021 × 10⁹⁵(96-digit number)
80213704305089924302…17945453334264340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.604 × 10⁹⁶(97-digit number)
16042740861017984860…35890906668528680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.208 × 10⁹⁶(97-digit number)
32085481722035969721…71781813337057361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.417 × 10⁹⁶(97-digit number)
64170963444071939442…43563626674114723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.283 × 10⁹⁷(98-digit number)
12834192688814387888…87127253348229447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.566 × 10⁹⁷(98-digit number)
25668385377628775776…74254506696458895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.133 × 10⁹⁷(98-digit number)
51336770755257551553…48509013392917790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.026 × 10⁹⁸(99-digit number)
10267354151051510310…97018026785835581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.053 × 10⁹⁸(99-digit number)
20534708302103020621…94036053571671162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.106 × 10⁹⁸(99-digit number)
41069416604206041243…88072107143342325761
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,992,609 XPM·at block #6,843,528 · 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