Block #400,720

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 7:14:15 AM · Difficulty 10.4288 · 6,424,648 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e2512d25e291473f657aa48a25f49e2495f090d3da82ed737c2b0206419d520d

Height

#400,720

Difficulty

10.428802

Transactions

2

Size

610 B

Version

2

Bits

0a6dc5fd

Nonce

23,591

Timestamp

2/12/2014, 7:14:15 AM

Confirmations

6,424,648

Merkle Root

fdc76f2cc6b7b90267f6fc50c9ced9d64f23c2e8a669511e4bc4629e1fc70103
Transactions (2)
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.714 × 10⁹⁸(99-digit number)
27144755154256739930…35921809373016447759
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.714 × 10⁹⁸(99-digit number)
27144755154256739930…35921809373016447759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.428 × 10⁹⁸(99-digit number)
54289510308513479861…71843618746032895519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.085 × 10⁹⁹(100-digit number)
10857902061702695972…43687237492065791039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.171 × 10⁹⁹(100-digit number)
21715804123405391944…87374474984131582079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.343 × 10⁹⁹(100-digit number)
43431608246810783888…74748949968263164159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.686 × 10⁹⁹(100-digit number)
86863216493621567777…49497899936526328319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.737 × 10¹⁰⁰(101-digit number)
17372643298724313555…98995799873052656639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.474 × 10¹⁰⁰(101-digit number)
34745286597448627111…97991599746105313279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.949 × 10¹⁰⁰(101-digit number)
69490573194897254222…95983199492210626559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.389 × 10¹⁰¹(102-digit number)
13898114638979450844…91966398984421253119
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,847,041 XPM·at block #6,825,367 · 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