Block #400,642

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 6:02:21 AM · Difficulty 10.4284 · 6,426,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
daaa6e9839910b76ff152f8b10e6be52e678b7d1d5e61842e7cff97a3099579e

Height

#400,642

Difficulty

10.428420

Transactions

3

Size

1.73 KB

Version

2

Bits

0a6dacf6

Nonce

170,303

Timestamp

2/12/2014, 6:02:21 AM

Confirmations

6,426,541

Merkle Root

d4cce458e91b19d540903bf8131d1d8a70464b316d082f31fabed4e2b380f7bb
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.020 × 10⁹⁵(96-digit number)
10205636950876248318…98124280814435993519
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.020 × 10⁹⁵(96-digit number)
10205636950876248318…98124280814435993519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.041 × 10⁹⁵(96-digit number)
20411273901752496637…96248561628871987039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.082 × 10⁹⁵(96-digit number)
40822547803504993275…92497123257743974079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.164 × 10⁹⁵(96-digit number)
81645095607009986550…84994246515487948159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.632 × 10⁹⁶(97-digit number)
16329019121401997310…69988493030975896319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.265 × 10⁹⁶(97-digit number)
32658038242803994620…39976986061951792639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.531 × 10⁹⁶(97-digit number)
65316076485607989240…79953972123903585279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.306 × 10⁹⁷(98-digit number)
13063215297121597848…59907944247807170559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.612 × 10⁹⁷(98-digit number)
26126430594243195696…19815888495614341119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.225 × 10⁹⁷(98-digit number)
52252861188486391392…39631776991228682239
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,861,560 XPM·at block #6,827,182 · 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