Block #394,858

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2014, 6:31:46 AM · Difficulty 10.4198 · 6,423,059 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27376565cfc9ef4b7c730c0c61e586a47b5446f96a0a7635b3738cf14c1388dd

Height

#394,858

Difficulty

10.419816

Transactions

2

Size

428 B

Version

2

Bits

0a6b7917

Nonce

40,654

Timestamp

2/8/2014, 6:31:46 AM

Confirmations

6,423,059

Merkle Root

2750fb1d516592e7e6c9c714ad80409f2dfe7d6356a977b2d45c965a4f4e9879
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.

5.518 × 10⁹⁸(99-digit number)
55181113470852186849…48355694473468453119
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.518 × 10⁹⁸(99-digit number)
55181113470852186849…48355694473468453119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.103 × 10⁹⁹(100-digit number)
11036222694170437369…96711388946936906239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.207 × 10⁹⁹(100-digit number)
22072445388340874739…93422777893873812479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.414 × 10⁹⁹(100-digit number)
44144890776681749479…86845555787747624959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.828 × 10⁹⁹(100-digit number)
88289781553363498959…73691111575495249919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.765 × 10¹⁰⁰(101-digit number)
17657956310672699791…47382223150990499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.531 × 10¹⁰⁰(101-digit number)
35315912621345399583…94764446301980999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.063 × 10¹⁰⁰(101-digit number)
70631825242690799167…89528892603961999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.412 × 10¹⁰¹(102-digit number)
14126365048538159833…79057785207923998719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.825 × 10¹⁰¹(102-digit number)
28252730097076319667…58115570415847997439
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,787,401 XPM·at block #6,817,916 · 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