Block #2,401,336

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2017, 3:58:04 PM · Difficulty 10.8902 · 4,442,664 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c176da4e0be4317963fb3e7544e053a0533cba9d9f40bf6e1092ac589afd8381

Height

#2,401,336

Difficulty

10.890198

Transactions

2

Size

722 B

Version

2

Bits

0ae3e40c

Nonce

67,158,700

Timestamp

11/29/2017, 3:58:04 PM

Confirmations

4,442,664

Merkle Root

76ef8a14416fc7b08c67bb60ec4381e7201906ebe523a9016ff8c245c6fd5772
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.

9.597 × 10⁹⁶(97-digit number)
95973456848951757453…23203343414566912001
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.597 × 10⁹⁶(97-digit number)
95973456848951757453…23203343414566912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.919 × 10⁹⁷(98-digit number)
19194691369790351490…46406686829133824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.838 × 10⁹⁷(98-digit number)
38389382739580702981…92813373658267648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.677 × 10⁹⁷(98-digit number)
76778765479161405962…85626747316535296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.535 × 10⁹⁸(99-digit number)
15355753095832281192…71253494633070592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.071 × 10⁹⁸(99-digit number)
30711506191664562385…42506989266141184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.142 × 10⁹⁸(99-digit number)
61423012383329124770…85013978532282368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.228 × 10⁹⁹(100-digit number)
12284602476665824954…70027957064564736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.456 × 10⁹⁹(100-digit number)
24569204953331649908…40055914129129472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.913 × 10⁹⁹(100-digit number)
49138409906663299816…80111828258258944001
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,996,382 XPM·at block #6,843,999 · 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