Block #423,336

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 9:43:00 AM · Difficulty 10.3705 · 6,386,517 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8320915e383d6f2760ec81c386b213b5d349d5e6ab39e3bc1e2334862f942073

Height

#423,336

Difficulty

10.370549

Transactions

2

Size

514 B

Version

2

Bits

0a5edc49

Nonce

321,224

Timestamp

2/28/2014, 9:43:00 AM

Confirmations

6,386,517

Merkle Root

483c037567518e67fe6acc34e4cac6eee42afef6c30da137618aea43563e1a51
Transactions (2)
1 in → 1 out9.2900 XPM116 B
2 in → 1 out17.4800 XPM306 B
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.411 × 10¹⁰⁰(101-digit number)
24118275902417987808…80103922409533376001
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.411 × 10¹⁰⁰(101-digit number)
24118275902417987808…80103922409533376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.823 × 10¹⁰⁰(101-digit number)
48236551804835975617…60207844819066752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.647 × 10¹⁰⁰(101-digit number)
96473103609671951235…20415689638133504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.929 × 10¹⁰¹(102-digit number)
19294620721934390247…40831379276267008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.858 × 10¹⁰¹(102-digit number)
38589241443868780494…81662758552534016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.717 × 10¹⁰¹(102-digit number)
77178482887737560988…63325517105068032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.543 × 10¹⁰²(103-digit number)
15435696577547512197…26651034210136064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.087 × 10¹⁰²(103-digit number)
30871393155095024395…53302068420272128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.174 × 10¹⁰²(103-digit number)
61742786310190048790…06604136840544256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.234 × 10¹⁰³(104-digit number)
12348557262038009758…13208273681088512001
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,722,911 XPM·at block #6,809,852 · 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