Block #469,331

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2014, 3:59:21 AM · Difficulty 10.4268 · 6,356,282 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b61551075df0362aaf5264780290fde55eeedf5f9ea7056e798c523527ff55e3

Height

#469,331

Difficulty

10.426836

Transactions

3

Size

951 B

Version

2

Bits

0a6d4528

Nonce

88,316

Timestamp

4/1/2014, 3:59:21 AM

Confirmations

6,356,282

Merkle Root

199dc68a1a812a30176ede458dd104c0172cbb8d54e9fb75e5a01de8f5fee839
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.608 × 10⁹⁹(100-digit number)
16082025148917371535…67093214181820377601
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.608 × 10⁹⁹(100-digit number)
16082025148917371535…67093214181820377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.216 × 10⁹⁹(100-digit number)
32164050297834743070…34186428363640755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.432 × 10⁹⁹(100-digit number)
64328100595669486140…68372856727281510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.286 × 10¹⁰⁰(101-digit number)
12865620119133897228…36745713454563020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.573 × 10¹⁰⁰(101-digit number)
25731240238267794456…73491426909126041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.146 × 10¹⁰⁰(101-digit number)
51462480476535588912…46982853818252083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.029 × 10¹⁰¹(102-digit number)
10292496095307117782…93965707636504166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.058 × 10¹⁰¹(102-digit number)
20584992190614235564…87931415273008332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.116 × 10¹⁰¹(102-digit number)
41169984381228471129…75862830546016665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.233 × 10¹⁰¹(102-digit number)
82339968762456942259…51725661092033331201
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,849,007 XPM·at block #6,825,612 · 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