Block #2,144,996

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/4/2017, 8:29:17 AM · Difficulty 10.8867 · 4,681,654 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb1dbedbb56fecdda7cc8e8cd0336e1628f11a62b0a846a67796bc817fd99aad

Height

#2,144,996

Difficulty

10.886711

Transactions

2

Size

1.57 KB

Version

2

Bits

0ae2ff81

Nonce

705,909,482

Timestamp

6/4/2017, 8:29:17 AM

Confirmations

4,681,654

Merkle Root

5a96b14170d742465f39e1385eba6fae0dbd60220924127610a83822a86a020a
Transactions (2)
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.

5.516 × 10⁹⁴(95-digit number)
55168669595812002975…28031211184985706561
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
5.516 × 10⁹⁴(95-digit number)
55168669595812002975…28031211184985706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.103 × 10⁹⁵(96-digit number)
11033733919162400595…56062422369971413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.206 × 10⁹⁵(96-digit number)
22067467838324801190…12124844739942826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.413 × 10⁹⁵(96-digit number)
44134935676649602380…24249689479885652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.826 × 10⁹⁵(96-digit number)
88269871353299204761…48499378959771304961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.765 × 10⁹⁶(97-digit number)
17653974270659840952…96998757919542609921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.530 × 10⁹⁶(97-digit number)
35307948541319681904…93997515839085219841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.061 × 10⁹⁶(97-digit number)
70615897082639363809…87995031678170439681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.412 × 10⁹⁷(98-digit number)
14123179416527872761…75990063356340879361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.824 × 10⁹⁷(98-digit number)
28246358833055745523…51980126712681758721
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,857,349 XPM·at block #6,826,649 · 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