Block #403,922

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 12:13:33 PM · Difficulty 10.4325 · 6,406,805 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b0691ad41b9b8653bb28a1a823ffed81f769b24604590ad7ddb35bcaadfb9653

Height

#403,922

Difficulty

10.432517

Transactions

1

Size

902 B

Version

2

Bits

0a6eb96c

Nonce

683,525

Timestamp

2/14/2014, 12:13:33 PM

Confirmations

6,406,805

Merkle Root

ac34d8ead9dc058340c6e8aede1e2a047f994ee3d5fbd1d0728ca0df5779afe9
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.954 × 10⁹⁸(99-digit number)
19547135391357738436…19460870839885068021
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.954 × 10⁹⁸(99-digit number)
19547135391357738436…19460870839885068021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.909 × 10⁹⁸(99-digit number)
39094270782715476873…38921741679770136041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.818 × 10⁹⁸(99-digit number)
78188541565430953747…77843483359540272081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.563 × 10⁹⁹(100-digit number)
15637708313086190749…55686966719080544161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.127 × 10⁹⁹(100-digit number)
31275416626172381499…11373933438161088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.255 × 10⁹⁹(100-digit number)
62550833252344762998…22747866876322176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.251 × 10¹⁰⁰(101-digit number)
12510166650468952599…45495733752644353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.502 × 10¹⁰⁰(101-digit number)
25020333300937905199…90991467505288706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.004 × 10¹⁰⁰(101-digit number)
50040666601875810398…81982935010577413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.000 × 10¹⁰¹(102-digit number)
10008133320375162079…63965870021154826241
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,729,905 XPM·at block #6,810,726 · 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