Block #2,127,465

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2017, 12:12:31 AM · Difficulty 10.9185 · 4,680,564 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
61bea91c8d50edf315b9a7fd0192d2b69df3719a1e668c6f1fa1bf0df4b84186

Height

#2,127,465

Difficulty

10.918471

Transactions

3

Size

1.50 KB

Version

2

Bits

0aeb20e3

Nonce

1,925,306,173

Timestamp

5/22/2017, 12:12:31 AM

Confirmations

4,680,564

Merkle Root

e6497a17565fe52d269ad67016ed2e088540a03efd232d8c125a464c543f09e3
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.319 × 10⁹⁴(95-digit number)
13195747242194241517…30363619983040476059
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.319 × 10⁹⁴(95-digit number)
13195747242194241517…30363619983040476059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.639 × 10⁹⁴(95-digit number)
26391494484388483034…60727239966080952119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.278 × 10⁹⁴(95-digit number)
52782988968776966069…21454479932161904239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.055 × 10⁹⁵(96-digit number)
10556597793755393213…42908959864323808479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.111 × 10⁹⁵(96-digit number)
21113195587510786427…85817919728647616959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.222 × 10⁹⁵(96-digit number)
42226391175021572855…71635839457295233919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.445 × 10⁹⁵(96-digit number)
84452782350043145710…43271678914590467839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.689 × 10⁹⁶(97-digit number)
16890556470008629142…86543357829180935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.378 × 10⁹⁶(97-digit number)
33781112940017258284…73086715658361871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.756 × 10⁹⁶(97-digit number)
67562225880034516568…46173431316723742719
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,708,276 XPM·at block #6,808,028 · 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.

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