Block #2,251,391

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/14/2017, 4:13:20 PM · Difficulty 10.9483 · 4,575,961 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
40b1fa3aafcde2ebfcb5d9d71f416ac48d54f257d31fc7da1e709dcb855722ef

Height

#2,251,391

Difficulty

10.948324

Transactions

2

Size

1.14 KB

Version

2

Bits

0af2c557

Nonce

302,147,200

Timestamp

8/14/2017, 4:13:20 PM

Confirmations

4,575,961

Merkle Root

02cc53662050ed469e626eb7aaf4229baad4d7bca8ce9a51db28a135b71e4512
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.769 × 10⁹⁵(96-digit number)
37690074708341009743…19478158833783697919
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.769 × 10⁹⁵(96-digit number)
37690074708341009743…19478158833783697919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.538 × 10⁹⁵(96-digit number)
75380149416682019487…38956317667567395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.507 × 10⁹⁶(97-digit number)
15076029883336403897…77912635335134791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.015 × 10⁹⁶(97-digit number)
30152059766672807795…55825270670269583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.030 × 10⁹⁶(97-digit number)
60304119533345615590…11650541340539166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.206 × 10⁹⁷(98-digit number)
12060823906669123118…23301082681078333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.412 × 10⁹⁷(98-digit number)
24121647813338246236…46602165362156666879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.824 × 10⁹⁷(98-digit number)
48243295626676492472…93204330724313333759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.648 × 10⁹⁷(98-digit number)
96486591253352984944…86408661448626667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.929 × 10⁹⁸(99-digit number)
19297318250670596988…72817322897253335039
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,862,915 XPM·at block #6,827,351 · 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