Block #426,349

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/2/2014, 1:21:43 PM · Difficulty 10.3613 · 6,381,618 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
548bb9d6ab1f6ee9dfb81269b4983459d02c4b6b5ce5b393a1c110486ed049f4

Height

#426,349

Difficulty

10.361307

Transactions

2

Size

733 B

Version

2

Bits

0a5c7e9e

Nonce

83,191

Timestamp

3/2/2014, 1:21:43 PM

Confirmations

6,381,618

Merkle Root

cdb57a0ceaf91d9640e9110c076074134dad4d979fe42f6649cb3009088da12c
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.

1.086 × 10¹⁰¹(102-digit number)
10869962529349220647…68143669519402611201
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.086 × 10¹⁰¹(102-digit number)
10869962529349220647…68143669519402611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.173 × 10¹⁰¹(102-digit number)
21739925058698441294…36287339038805222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.347 × 10¹⁰¹(102-digit number)
43479850117396882589…72574678077610444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.695 × 10¹⁰¹(102-digit number)
86959700234793765179…45149356155220889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.739 × 10¹⁰²(103-digit number)
17391940046958753035…90298712310441779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.478 × 10¹⁰²(103-digit number)
34783880093917506071…80597424620883558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.956 × 10¹⁰²(103-digit number)
69567760187835012143…61194849241767116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.391 × 10¹⁰³(104-digit number)
13913552037567002428…22389698483534233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.782 × 10¹⁰³(104-digit number)
27827104075134004857…44779396967068467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.565 × 10¹⁰³(104-digit number)
55654208150268009715…89558793934136934401
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,707,779 XPM·at block #6,807,966 · 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