Block #2,288,140

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/8/2017, 6:04:36 PM · Difficulty 10.9555 · 4,544,643 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
37a1fd177c2a09b4ec655abefbf710ce8b46f99d7f17e6edf104288f73fdf7fc

Height

#2,288,140

Difficulty

10.955522

Transactions

36

Size

12.03 KB

Version

2

Bits

0af49d15

Nonce

539,617,856

Timestamp

9/8/2017, 6:04:36 PM

Confirmations

4,544,643

Merkle Root

c146b83a5d21b9f8dab8e4859c9af87bfbad9d5b0f8c966ff4f5bb1ee99aa1b3
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.

8.431 × 10⁹⁵(96-digit number)
84313648695198792460…93865438660954475519
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
8.431 × 10⁹⁵(96-digit number)
84313648695198792460…93865438660954475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.686 × 10⁹⁶(97-digit number)
16862729739039758492…87730877321908951039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.372 × 10⁹⁶(97-digit number)
33725459478079516984…75461754643817902079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.745 × 10⁹⁶(97-digit number)
67450918956159033968…50923509287635804159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.349 × 10⁹⁷(98-digit number)
13490183791231806793…01847018575271608319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.698 × 10⁹⁷(98-digit number)
26980367582463613587…03694037150543216639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.396 × 10⁹⁷(98-digit number)
53960735164927227174…07388074301086433279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.079 × 10⁹⁸(99-digit number)
10792147032985445434…14776148602172866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.158 × 10⁹⁸(99-digit number)
21584294065970890869…29552297204345733119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.316 × 10⁹⁸(99-digit number)
43168588131941781739…59104594408691466239
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,906,430 XPM·at block #6,832,782 · 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