Block #2,107,657

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2017, 3:09:22 AM · Difficulty 10.8945 · 4,719,454 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d9596ec0181ce9f9bf620d87a7d959255488e83dc2189ae75138c14024dfddcc

Height

#2,107,657

Difficulty

10.894495

Transactions

32

Size

10.42 KB

Version

2

Bits

0ae4fd9b

Nonce

349,890,558

Timestamp

5/9/2017, 3:09:22 AM

Confirmations

4,719,454

Merkle Root

66e9b6b828d5659f04863afa7bc65fbe76a3b363273a6d6f47c3294571bc513b
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.

7.268 × 10⁹³(94-digit number)
72684902479461195511…13992933311195952639
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
7.268 × 10⁹³(94-digit number)
72684902479461195511…13992933311195952639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.453 × 10⁹⁴(95-digit number)
14536980495892239102…27985866622391905279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.907 × 10⁹⁴(95-digit number)
29073960991784478204…55971733244783810559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.814 × 10⁹⁴(95-digit number)
58147921983568956409…11943466489567621119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.162 × 10⁹⁵(96-digit number)
11629584396713791281…23886932979135242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.325 × 10⁹⁵(96-digit number)
23259168793427582563…47773865958270484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.651 × 10⁹⁵(96-digit number)
46518337586855165127…95547731916540968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.303 × 10⁹⁵(96-digit number)
93036675173710330254…91095463833081937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.860 × 10⁹⁶(97-digit number)
18607335034742066050…82190927666163875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.721 × 10⁹⁶(97-digit number)
37214670069484132101…64381855332327751679
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,861,067 XPM·at block #6,827,110 · 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