Block #402,471

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2014, 11:21:57 AM · Difficulty 10.4365 · 6,403,783 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b5600c26aae217cef2b23b6915fca1d245be115811de80555b27c723c741a07f

Height

#402,471

Difficulty

10.436498

Transactions

1

Size

835 B

Version

2

Bits

0a6fbe4d

Nonce

38,270

Timestamp

2/13/2014, 11:21:57 AM

Confirmations

6,403,783

Merkle Root

50d676e1f4ae25430cbb7b3b5c178f70da828b49718c086f80a6df544e0a4d8d
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.452 × 10⁹⁸(99-digit number)
24528334239844816264…62059715354269820159
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.452 × 10⁹⁸(99-digit number)
24528334239844816264…62059715354269820159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.905 × 10⁹⁸(99-digit number)
49056668479689632529…24119430708539640319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.811 × 10⁹⁸(99-digit number)
98113336959379265059…48238861417079280639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.962 × 10⁹⁹(100-digit number)
19622667391875853011…96477722834158561279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.924 × 10⁹⁹(100-digit number)
39245334783751706023…92955445668317122559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.849 × 10⁹⁹(100-digit number)
78490669567503412047…85910891336634245119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.569 × 10¹⁰⁰(101-digit number)
15698133913500682409…71821782673268490239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.139 × 10¹⁰⁰(101-digit number)
31396267827001364818…43643565346536980479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.279 × 10¹⁰⁰(101-digit number)
62792535654002729637…87287130693073960959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.255 × 10¹⁰¹(102-digit number)
12558507130800545927…74574261386147921919
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,694,115 XPM·at block #6,806,253 · 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