Block #471,950

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2014, 10:33:27 PM · Difficulty 10.4363 · 6,336,926 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9745d3bb43890e758a2a3383a44f64b740fe4c2b4ac0aca8f230c49db2f784dd

Height

#471,950

Difficulty

10.436300

Transactions

14

Size

3.22 KB

Version

2

Bits

0a6fb15f

Nonce

513,673

Timestamp

4/2/2014, 10:33:27 PM

Confirmations

6,336,926

Merkle Root

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

5.866 × 10⁹⁸(99-digit number)
58664531786055117331…25554499649242030381
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
5.866 × 10⁹⁸(99-digit number)
58664531786055117331…25554499649242030381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.173 × 10⁹⁹(100-digit number)
11732906357211023466…51108999298484060761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.346 × 10⁹⁹(100-digit number)
23465812714422046932…02217998596968121521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.693 × 10⁹⁹(100-digit number)
46931625428844093865…04435997193936243041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.386 × 10⁹⁹(100-digit number)
93863250857688187730…08871994387872486081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.877 × 10¹⁰⁰(101-digit number)
18772650171537637546…17743988775744972161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.754 × 10¹⁰⁰(101-digit number)
37545300343075275092…35487977551489944321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.509 × 10¹⁰⁰(101-digit number)
75090600686150550184…70975955102979888641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.501 × 10¹⁰¹(102-digit number)
15018120137230110036…41951910205959777281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.003 × 10¹⁰¹(102-digit number)
30036240274460220073…83903820411919554561
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,715,059 XPM·at block #6,808,875 · 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