Block #402,762

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2014, 4:13:28 PM · Difficulty 10.4366 · 6,409,759 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a98faf8b88a8e5e93f50ecd0cc385f64fc056d7a88b79cf557824afd01c9318d

Height

#402,762

Difficulty

10.436568

Transactions

2

Size

3.31 KB

Version

2

Bits

0a6fc2f1

Nonce

14,543

Timestamp

2/13/2014, 4:13:28 PM

Confirmations

6,409,759

Merkle Root

27467034c79e64f4ee34fdab913d1ce30e066f3e27a50edd3f2596cb8b989830
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.

3.398 × 10⁹⁸(99-digit number)
33987562710394613130…69271188049818004519
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.398 × 10⁹⁸(99-digit number)
33987562710394613130…69271188049818004519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.797 × 10⁹⁸(99-digit number)
67975125420789226261…38542376099636009039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.359 × 10⁹⁹(100-digit number)
13595025084157845252…77084752199272018079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.719 × 10⁹⁹(100-digit number)
27190050168315690504…54169504398544036159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.438 × 10⁹⁹(100-digit number)
54380100336631381009…08339008797088072319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.087 × 10¹⁰⁰(101-digit number)
10876020067326276201…16678017594176144639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.175 × 10¹⁰⁰(101-digit number)
21752040134652552403…33356035188352289279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.350 × 10¹⁰⁰(101-digit number)
43504080269305104807…66712070376704578559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.700 × 10¹⁰⁰(101-digit number)
87008160538610209614…33424140753409157119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.740 × 10¹⁰¹(102-digit number)
17401632107722041922…66848281506818314239
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,744,202 XPM·at block #6,812,520 · 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