Block #2,125,664

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/20/2017, 5:26:37 PM · Difficulty 10.9191 · 4,701,135 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bf743a5dcb78536af99f4d3687c9d5464b80483b2de17c847b61979e2aa8da39

Height

#2,125,664

Difficulty

10.919125

Transactions

33

Size

10.26 KB

Version

2

Bits

0aeb4bc6

Nonce

1,091,636,221

Timestamp

5/20/2017, 5:26:37 PM

Confirmations

4,701,135

Merkle Root

2175b0fd41ab253cdf398c82c67686c5c55c3ef5bec7de466eba61da52df0e16
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.

6.678 × 10⁹⁵(96-digit number)
66787944537493978585…38742438167225794559
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
6.678 × 10⁹⁵(96-digit number)
66787944537493978585…38742438167225794559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.335 × 10⁹⁶(97-digit number)
13357588907498795717…77484876334451589119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.671 × 10⁹⁶(97-digit number)
26715177814997591434…54969752668903178239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.343 × 10⁹⁶(97-digit number)
53430355629995182868…09939505337806356479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.068 × 10⁹⁷(98-digit number)
10686071125999036573…19879010675612712959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.137 × 10⁹⁷(98-digit number)
21372142251998073147…39758021351225425919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.274 × 10⁹⁷(98-digit number)
42744284503996146294…79516042702450851839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.548 × 10⁹⁷(98-digit number)
85488569007992292589…59032085404901703679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.709 × 10⁹⁸(99-digit number)
17097713801598458517…18064170809803407359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.419 × 10⁹⁸(99-digit number)
34195427603196917035…36128341619606814719
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,858,555 XPM·at block #6,826,798 · 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