Block #2,159,786

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2017, 2:35:32 AM · Difficulty 10.9027 · 4,679,102 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b66d6bd76959d3a39ca9e73aca28815103a9e47a3826cc7484709972d12c86f8

Height

#2,159,786

Difficulty

10.902685

Transactions

5

Size

2.38 KB

Version

2

Bits

0ae71660

Nonce

3,559,705

Timestamp

6/14/2017, 2:35:32 AM

Confirmations

4,679,102

Merkle Root

db7ce3cf8b8de96745766e51ff6e7b09da03e848a9eae47f3133a3d61bd2783b
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.704 × 10⁹⁴(95-digit number)
17046986519514994472…25139384669540828639
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.704 × 10⁹⁴(95-digit number)
17046986519514994472…25139384669540828639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.409 × 10⁹⁴(95-digit number)
34093973039029988945…50278769339081657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.818 × 10⁹⁴(95-digit number)
68187946078059977890…00557538678163314559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.363 × 10⁹⁵(96-digit number)
13637589215611995578…01115077356326629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.727 × 10⁹⁵(96-digit number)
27275178431223991156…02230154712653258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.455 × 10⁹⁵(96-digit number)
54550356862447982312…04460309425306516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.091 × 10⁹⁶(97-digit number)
10910071372489596462…08920618850613032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.182 × 10⁹⁶(97-digit number)
21820142744979192924…17841237701226065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.364 × 10⁹⁶(97-digit number)
43640285489958385849…35682475402452131839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.728 × 10⁹⁶(97-digit number)
87280570979916771699…71364950804904263679
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,955,373 XPM·at block #6,838,887 · 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