Block #401,750

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 11:48:40 PM · Difficulty 10.4333 · 6,415,379 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a764aa9c59e394027a669b20355d8579afec001fd38ec55b9acd98f60d7080c

Height

#401,750

Difficulty

10.433329

Transactions

7

Size

2.54 KB

Version

2

Bits

0a6eeeac

Nonce

339,520

Timestamp

2/12/2014, 11:48:40 PM

Confirmations

6,415,379

Merkle Root

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

3.499 × 10⁹⁸(99-digit number)
34996934297001091125…39394716187545433399
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
3.499 × 10⁹⁸(99-digit number)
34996934297001091125…39394716187545433399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.999 × 10⁹⁸(99-digit number)
69993868594002182251…78789432375090866799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.399 × 10⁹⁹(100-digit number)
13998773718800436450…57578864750181733599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.799 × 10⁹⁹(100-digit number)
27997547437600872900…15157729500363467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.599 × 10⁹⁹(100-digit number)
55995094875201745801…30315459000726934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.119 × 10¹⁰⁰(101-digit number)
11199018975040349160…60630918001453868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.239 × 10¹⁰⁰(101-digit number)
22398037950080698320…21261836002907737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.479 × 10¹⁰⁰(101-digit number)
44796075900161396640…42523672005815475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.959 × 10¹⁰⁰(101-digit number)
89592151800322793281…85047344011630950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.791 × 10¹⁰¹(102-digit number)
17918430360064558656…70094688023261900799
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,781,066 XPM·at block #6,817,128 · 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