Block #2,111,230

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2017, 7:08:33 AM · Difficulty 10.9037 · 4,731,694 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c42759867bfa16de00964f45ce91d0307d1611af1ccb631e903854e95aab5082

Height

#2,111,230

Difficulty

10.903728

Transactions

4

Size

1.29 KB

Version

2

Bits

0ae75ab2

Nonce

836,092,469

Timestamp

5/11/2017, 7:08:33 AM

Confirmations

4,731,694

Merkle Root

a9ff43e40b01ae2746bd2e6d5abf18e757dd69fbc32ab2fcd1b3e710cba99594
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.674 × 10⁹⁵(96-digit number)
36749490386943394017…67744387393747779839
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.674 × 10⁹⁵(96-digit number)
36749490386943394017…67744387393747779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.349 × 10⁹⁵(96-digit number)
73498980773886788035…35488774787495559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.469 × 10⁹⁶(97-digit number)
14699796154777357607…70977549574991119359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.939 × 10⁹⁶(97-digit number)
29399592309554715214…41955099149982238719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.879 × 10⁹⁶(97-digit number)
58799184619109430428…83910198299964477439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.175 × 10⁹⁷(98-digit number)
11759836923821886085…67820396599928954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.351 × 10⁹⁷(98-digit number)
23519673847643772171…35640793199857909759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.703 × 10⁹⁷(98-digit number)
47039347695287544342…71281586399715819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.407 × 10⁹⁷(98-digit number)
94078695390575088685…42563172799431639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.881 × 10⁹⁸(99-digit number)
18815739078115017737…85126345598863278079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.763 × 10⁹⁸(99-digit number)
37631478156230035474…70252691197726556159
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,987,740 XPM·at block #6,842,923 · 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