Block #399,427

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/11/2014, 10:18:29 AM · Difficulty 10.4239 · 6,425,938 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7fedea8f0431a4bcd9844125e9ac5b6d94da5bd066e937891f6f2e370af80824

Height

#399,427

Difficulty

10.423926

Transactions

8

Size

2.00 KB

Version

2

Bits

0a6c8663

Nonce

125,132

Timestamp

2/11/2014, 10:18:29 AM

Confirmations

6,425,938

Merkle Root

b2a1d9e1b8f13eab97362c0863a399bd9761a63de3e0bac39116fe8144082312
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.102 × 10¹⁰¹(102-digit number)
11025532846400577775…87829798633044080639
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.102 × 10¹⁰¹(102-digit number)
11025532846400577775…87829798633044080639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.205 × 10¹⁰¹(102-digit number)
22051065692801155551…75659597266088161279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.410 × 10¹⁰¹(102-digit number)
44102131385602311103…51319194532176322559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.820 × 10¹⁰¹(102-digit number)
88204262771204622206…02638389064352645119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.764 × 10¹⁰²(103-digit number)
17640852554240924441…05276778128705290239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.528 × 10¹⁰²(103-digit number)
35281705108481848882…10553556257410580479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.056 × 10¹⁰²(103-digit number)
70563410216963697765…21107112514821160959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.411 × 10¹⁰³(104-digit number)
14112682043392739553…42214225029642321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.822 × 10¹⁰³(104-digit number)
28225364086785479106…84428450059284643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.645 × 10¹⁰³(104-digit number)
56450728173570958212…68856900118569287679
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,016 XPM·at block #6,825,364 · 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