Block #404,413

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/14/2014, 8:10:36 PM · Difficulty 10.4341 · 6,404,337 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a27c4383db80cd8bfc89b2ddbf3a0938e97d1aaaeaaf80c75c789d31317ee7b7

Height

#404,413

Difficulty

10.434087

Transactions

1

Size

869 B

Version

2

Bits

0a6f204c

Nonce

302,123

Timestamp

2/14/2014, 8:10:36 PM

Confirmations

6,404,337

Merkle Root

1211a6179ab7173dc21bde7fb2e5191bc16af648350f48a1faaa71f6bb82c6a7
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.

5.386 × 10⁹⁸(99-digit number)
53869688975971340465…00055716652902896639
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
5.386 × 10⁹⁸(99-digit number)
53869688975971340465…00055716652902896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.077 × 10⁹⁹(100-digit number)
10773937795194268093…00111433305805793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.154 × 10⁹⁹(100-digit number)
21547875590388536186…00222866611611586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.309 × 10⁹⁹(100-digit number)
43095751180777072372…00445733223223173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.619 × 10⁹⁹(100-digit number)
86191502361554144744…00891466446446346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.723 × 10¹⁰⁰(101-digit number)
17238300472310828948…01782932892892692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.447 × 10¹⁰⁰(101-digit number)
34476600944621657897…03565865785785384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.895 × 10¹⁰⁰(101-digit number)
68953201889243315795…07131731571570769919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.379 × 10¹⁰¹(102-digit number)
13790640377848663159…14263463143141539839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.758 × 10¹⁰¹(102-digit number)
27581280755697326318…28526926286283079679
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,714,049 XPM·at block #6,808,749 · 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