Block #2,288,626

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/9/2017, 2:22:40 AM · Difficulty 10.9554 · 4,553,523 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
907c8994fe5acd9b7e977cfbece6f82c3b5b49b7f8ed8f963d92cee5b4ff382d

Height

#2,288,626

Difficulty

10.955427

Transactions

6

Size

1.30 KB

Version

2

Bits

0af496d5

Nonce

1,256,609,931

Timestamp

9/9/2017, 2:22:40 AM

Confirmations

4,553,523

Merkle Root

0d13fd83b68a458b4c759497fe41e9884de19e79deef769f2732b93f68d3409a
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.

4.790 × 10⁹⁴(95-digit number)
47902546442152267629…81943100117249843199
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
4.790 × 10⁹⁴(95-digit number)
47902546442152267629…81943100117249843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.580 × 10⁹⁴(95-digit number)
95805092884304535258…63886200234499686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.916 × 10⁹⁵(96-digit number)
19161018576860907051…27772400468999372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.832 × 10⁹⁵(96-digit number)
38322037153721814103…55544800937998745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.664 × 10⁹⁵(96-digit number)
76644074307443628206…11089601875997491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.532 × 10⁹⁶(97-digit number)
15328814861488725641…22179203751994982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.065 × 10⁹⁶(97-digit number)
30657629722977451282…44358407503989964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.131 × 10⁹⁶(97-digit number)
61315259445954902565…88716815007979929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.226 × 10⁹⁷(98-digit number)
12263051889190980513…77433630015959859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.452 × 10⁹⁷(98-digit number)
24526103778381961026…54867260031919718399
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 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
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 1CC formula:

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