Block #2,105,584

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2017, 11:33:27 PM · Difficulty 10.8853 · 4,732,905 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bbe378a95ccf13cf2ec88bca047f747d8d02d15f39371f8fa60525201b1aed03

Height

#2,105,584

Difficulty

10.885324

Transactions

2

Size

871 B

Version

2

Bits

0ae2a4a0

Nonce

1,287,735,573

Timestamp

5/7/2017, 11:33:27 PM

Confirmations

4,732,905

Merkle Root

57a69ba54fd822787cc5439c9d50bbdc94d831a366d6e49f2e6367f8eeda620e
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.

3.652 × 10⁹³(94-digit number)
36521447255230052805…35573849312318108299
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.652 × 10⁹³(94-digit number)
36521447255230052805…35573849312318108299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.304 × 10⁹³(94-digit number)
73042894510460105610…71147698624636216599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.460 × 10⁹⁴(95-digit number)
14608578902092021122…42295397249272433199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.921 × 10⁹⁴(95-digit number)
29217157804184042244…84590794498544866399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.843 × 10⁹⁴(95-digit number)
58434315608368084488…69181588997089732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.168 × 10⁹⁵(96-digit number)
11686863121673616897…38363177994179465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.337 × 10⁹⁵(96-digit number)
23373726243347233795…76726355988358931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.674 × 10⁹⁵(96-digit number)
46747452486694467590…53452711976717862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.349 × 10⁹⁵(96-digit number)
93494904973388935180…06905423953435724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.869 × 10⁹⁶(97-digit number)
18698980994677787036…13810847906871449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.739 × 10⁹⁶(97-digit number)
37397961989355574072…27621695813742899199
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,952,184 XPM·at block #6,838,488 · 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