Block #2,285,211

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2017, 5:43:55 PM · Difficulty 10.9552 · 4,547,255 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
262b2a7525fe196757c0fc643d041bf824eaf19bd4210e7a5d2deebe88033069

Height

#2,285,211

Difficulty

10.955186

Transactions

2

Size

426 B

Version

2

Bits

0af4870b

Nonce

496,963,407

Timestamp

9/6/2017, 5:43:55 PM

Confirmations

4,547,255

Merkle Root

6737cd6294a04475db91bacce4eb30eb0e938939e2df0805446519a78fdc3d0d
Transactions (2)
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.

6.286 × 10⁹⁴(95-digit number)
62867523575747293375…39106175070150604801
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
6.286 × 10⁹⁴(95-digit number)
62867523575747293375…39106175070150604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.257 × 10⁹⁵(96-digit number)
12573504715149458675…78212350140301209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.514 × 10⁹⁵(96-digit number)
25147009430298917350…56424700280602419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.029 × 10⁹⁵(96-digit number)
50294018860597834700…12849400561204838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.005 × 10⁹⁶(97-digit number)
10058803772119566940…25698801122409676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.011 × 10⁹⁶(97-digit number)
20117607544239133880…51397602244819353601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.023 × 10⁹⁶(97-digit number)
40235215088478267760…02795204489638707201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.047 × 10⁹⁶(97-digit number)
80470430176956535520…05590408979277414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.609 × 10⁹⁷(98-digit number)
16094086035391307104…11180817958554828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.218 × 10⁹⁷(98-digit number)
32188172070782614208…22361635917109657601
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,903,879 XPM·at block #6,832,465 · 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