Block #2,176,965

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2017, 7:23:20 AM · Difficulty 10.9215 · 4,659,954 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6806ed488439c46d17c2e5673ba5b3235a839b3b2611a5020d35d6f25c4d7195

Height

#2,176,965

Difficulty

10.921460

Transactions

6

Size

2.31 KB

Version

2

Bits

0aebe4d4

Nonce

487,512,633

Timestamp

6/25/2017, 7:23:20 AM

Confirmations

4,659,954

Merkle Root

5b75f010ab5c565723b46ccd6255898b36d8a10ff40fbe34c984624d0916c8a3
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.

9.008 × 10⁹⁴(95-digit number)
90088859880693196258…83155880740401589761
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
9.008 × 10⁹⁴(95-digit number)
90088859880693196258…83155880740401589761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.801 × 10⁹⁵(96-digit number)
18017771976138639251…66311761480803179521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.603 × 10⁹⁵(96-digit number)
36035543952277278503…32623522961606359041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.207 × 10⁹⁵(96-digit number)
72071087904554557007…65247045923212718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.441 × 10⁹⁶(97-digit number)
14414217580910911401…30494091846425436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.882 × 10⁹⁶(97-digit number)
28828435161821822802…60988183692850872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.765 × 10⁹⁶(97-digit number)
57656870323643645605…21976367385701744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.153 × 10⁹⁷(98-digit number)
11531374064728729121…43952734771403489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.306 × 10⁹⁷(98-digit number)
23062748129457458242…87905469542806978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.612 × 10⁹⁷(98-digit number)
46125496258914916484…75810939085613957121
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,939,646 XPM·at block #6,836,918 · 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