Block #2,288,566

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/9/2017, 1:21:15 AM · Difficulty 10.9554 · 4,538,357 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6df173d11c05fa32040b3683feda71a8ae9191c5d8ee105f1f2c3426121b0a84

Height

#2,288,566

Difficulty

10.955437

Transactions

2

Size

1015 B

Version

2

Bits

0af4978c

Nonce

755,334,034

Timestamp

9/9/2017, 1:21:15 AM

Confirmations

4,538,357

Merkle Root

4720df9f341cd81750e5786239cd306b8b2c954625a332f19377254bfab9b327
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.

1.076 × 10⁹⁵(96-digit number)
10769089476962410444…33270281974960150721
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.076 × 10⁹⁵(96-digit number)
10769089476962410444…33270281974960150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.153 × 10⁹⁵(96-digit number)
21538178953924820889…66540563949920301441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.307 × 10⁹⁵(96-digit number)
43076357907849641778…33081127899840602881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.615 × 10⁹⁵(96-digit number)
86152715815699283556…66162255799681205761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.723 × 10⁹⁶(97-digit number)
17230543163139856711…32324511599362411521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.446 × 10⁹⁶(97-digit number)
34461086326279713422…64649023198724823041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.892 × 10⁹⁶(97-digit number)
68922172652559426845…29298046397449646081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.378 × 10⁹⁷(98-digit number)
13784434530511885369…58596092794899292161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.756 × 10⁹⁷(98-digit number)
27568869061023770738…17192185589798584321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.513 × 10⁹⁷(98-digit number)
55137738122047541476…34384371179597168641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.102 × 10⁹⁸(99-digit number)
11027547624409508295…68768742359194337281
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,859,555 XPM·at block #6,826,922 · 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