Block #2,142,229

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2017, 6:44:44 PM · Difficulty 10.8747 · 4,700,797 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a32906397cd14c160f8e1b2db943b5b0113f611448ba30dfe4f0e8d2b55b59cc

Height

#2,142,229

Difficulty

10.874710

Transactions

4

Size

1.72 KB

Version

2

Bits

0adfecf9

Nonce

1,050,343,274

Timestamp

6/2/2017, 6:44:44 PM

Confirmations

4,700,797

Merkle Root

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

1.575 × 10⁹⁵(96-digit number)
15755853352291971192…74110849301081402239
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
1.575 × 10⁹⁵(96-digit number)
15755853352291971192…74110849301081402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.151 × 10⁹⁵(96-digit number)
31511706704583942384…48221698602162804479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.302 × 10⁹⁵(96-digit number)
63023413409167884768…96443397204325608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.260 × 10⁹⁶(97-digit number)
12604682681833576953…92886794408651217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.520 × 10⁹⁶(97-digit number)
25209365363667153907…85773588817302435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.041 × 10⁹⁶(97-digit number)
50418730727334307814…71547177634604871679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.008 × 10⁹⁷(98-digit number)
10083746145466861562…43094355269209743359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.016 × 10⁹⁷(98-digit number)
20167492290933723125…86188710538419486719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.033 × 10⁹⁷(98-digit number)
40334984581867446251…72377421076838973439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.066 × 10⁹⁷(98-digit number)
80669969163734892503…44754842153677946879
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,988,562 XPM·at block #6,843,025 · 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