Block #2,270,477

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/27/2017, 3:30:07 PM · Difficulty 10.9529 · 4,556,688 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
089c0e361e0fa7022f1b8973bc80358106c48c7dd064a16ee18c3feddfbf320a

Height

#2,270,477

Difficulty

10.952890

Transactions

6

Size

3.32 KB

Version

2

Bits

0af3f09b

Nonce

923,086,635

Timestamp

8/27/2017, 3:30:07 PM

Confirmations

4,556,688

Merkle Root

78eec66b9e944b34fc30d411046f42625b9c62701ffc7a0b3b5cdcbf54ab08ce
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.102 × 10⁹³(94-digit number)
31026999955069747664…38916697048931353191
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.102 × 10⁹³(94-digit number)
31026999955069747664…38916697048931353191
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.205 × 10⁹³(94-digit number)
62053999910139495328…77833394097862706381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.241 × 10⁹⁴(95-digit number)
12410799982027899065…55666788195725412761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.482 × 10⁹⁴(95-digit number)
24821599964055798131…11333576391450825521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.964 × 10⁹⁴(95-digit number)
49643199928111596262…22667152782901651041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.928 × 10⁹⁴(95-digit number)
99286399856223192525…45334305565803302081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.985 × 10⁹⁵(96-digit number)
19857279971244638505…90668611131606604161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.971 × 10⁹⁵(96-digit number)
39714559942489277010…81337222263213208321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.942 × 10⁹⁵(96-digit number)
79429119884978554020…62674444526426416641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.588 × 10⁹⁶(97-digit number)
15885823976995710804…25348889052852833281
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,861,415 XPM·at block #6,827,164 · 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