Block #2,244,896

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2017, 5:20:39 AM · Difficulty 10.9473 · 4,581,829 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8cc55594ce36e19e75973a70dd2487c4e88826bf40012bd39ba8b763e923a9b

Height

#2,244,896

Difficulty

10.947280

Transactions

33

Size

7.92 KB

Version

2

Bits

0af280ec

Nonce

1,742,862,412

Timestamp

8/10/2017, 5:20:39 AM

Confirmations

4,581,829

Merkle Root

9f939ace478c9b55b59ccd2f94186b082351760ada2292b5322f3a514f5be85d
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.

2.088 × 10⁹⁶(97-digit number)
20882703115892155176…63766963416237680639
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
2.088 × 10⁹⁶(97-digit number)
20882703115892155176…63766963416237680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.176 × 10⁹⁶(97-digit number)
41765406231784310353…27533926832475361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.353 × 10⁹⁶(97-digit number)
83530812463568620707…55067853664950722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.670 × 10⁹⁷(98-digit number)
16706162492713724141…10135707329901445119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.341 × 10⁹⁷(98-digit number)
33412324985427448283…20271414659802890239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.682 × 10⁹⁷(98-digit number)
66824649970854896566…40542829319605780479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.336 × 10⁹⁸(99-digit number)
13364929994170979313…81085658639211560959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.672 × 10⁹⁸(99-digit number)
26729859988341958626…62171317278423121919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.345 × 10⁹⁸(99-digit number)
53459719976683917252…24342634556846243839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.069 × 10⁹⁹(100-digit number)
10691943995336783450…48685269113692487679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.138 × 10⁹⁹(100-digit number)
21383887990673566901…97370538227384975359
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,857,953 XPM·at block #6,826,724 · 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