Block #402,317

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2014, 9:11:29 AM · Difficulty 10.4341 · 6,413,750 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4dd8b10865c884cc6beca7637e2b2aca14b760635a6be8434fb84f5ebfbe3ba6

Height

#402,317

Difficulty

10.434068

Transactions

3

Size

659 B

Version

2

Bits

0a6f1f10

Nonce

369,102,300

Timestamp

2/13/2014, 9:11:29 AM

Confirmations

6,413,750

Merkle Root

1192142a4ade10a0bc8a27771501e92950a70bc71de38ae145ad904011f0d1c7
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.

4.815 × 10⁹⁵(96-digit number)
48154211437260070477…72693081387314545801
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
4.815 × 10⁹⁵(96-digit number)
48154211437260070477…72693081387314545801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.630 × 10⁹⁵(96-digit number)
96308422874520140955…45386162774629091601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.926 × 10⁹⁶(97-digit number)
19261684574904028191…90772325549258183201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.852 × 10⁹⁶(97-digit number)
38523369149808056382…81544651098516366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.704 × 10⁹⁶(97-digit number)
77046738299616112764…63089302197032732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.540 × 10⁹⁷(98-digit number)
15409347659923222552…26178604394065465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.081 × 10⁹⁷(98-digit number)
30818695319846445105…52357208788130931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.163 × 10⁹⁷(98-digit number)
61637390639692890211…04714417576261862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.232 × 10⁹⁸(99-digit number)
12327478127938578042…09428835152523724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.465 × 10⁹⁸(99-digit number)
24654956255877156084…18857670305047449601
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,772,653 XPM·at block #6,816,066 · 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