Block #403,659

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 8:02:21 AM · Difficulty 10.4310 · 6,423,099 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1963eb88ecee8d963b006088cf19e7aa81dfa858c982ac6f5687a34f7b133674

Height

#403,659

Difficulty

10.431039

Transactions

16

Size

4.45 KB

Version

2

Bits

0a6e5899

Nonce

479,879

Timestamp

2/14/2014, 8:02:21 AM

Confirmations

6,423,099

Merkle Root

199bc7f1d711dd553fbf8e1f7d8ff34f0aca2516baf2224b86e5ce32a6538ed9
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.

2.378 × 10⁹⁸(99-digit number)
23783285572341994774…45721281683046188801
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
2.378 × 10⁹⁸(99-digit number)
23783285572341994774…45721281683046188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.756 × 10⁹⁸(99-digit number)
47566571144683989549…91442563366092377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.513 × 10⁹⁸(99-digit number)
95133142289367979098…82885126732184755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.902 × 10⁹⁹(100-digit number)
19026628457873595819…65770253464369510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.805 × 10⁹⁹(100-digit number)
38053256915747191639…31540506928739020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.610 × 10⁹⁹(100-digit number)
76106513831494383279…63081013857478041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.522 × 10¹⁰⁰(101-digit number)
15221302766298876655…26162027714956083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.044 × 10¹⁰⁰(101-digit number)
30442605532597753311…52324055429912166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.088 × 10¹⁰⁰(101-digit number)
60885211065195506623…04648110859824332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.217 × 10¹⁰¹(102-digit number)
12177042213039101324…09296221719648665601
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,858,223 XPM·at block #6,826,757 · 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