Block #402,680

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2014, 2:48:32 PM · Difficulty 10.4371 · 6,413,375 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4477862e86bb5fb2fe38458b27d92d1cc298418bbb4cfe5891c3ff2ebc0c5b6a

Height

#402,680

Difficulty

10.437103

Transactions

2

Size

1.26 KB

Version

2

Bits

0a6fe602

Nonce

359,742

Timestamp

2/13/2014, 2:48:32 PM

Confirmations

6,413,375

Merkle Root

41d789e1d6aa92b6aeb80762b677ab1fc404b5a065676cf3352fbe653ba31e6b
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.437 × 10¹⁰¹(102-digit number)
54373573322013431864…40751925948885369599
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.437 × 10¹⁰¹(102-digit number)
54373573322013431864…40751925948885369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.087 × 10¹⁰²(103-digit number)
10874714664402686372…81503851897770739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.174 × 10¹⁰²(103-digit number)
21749429328805372745…63007703795541478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.349 × 10¹⁰²(103-digit number)
43498858657610745491…26015407591082956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.699 × 10¹⁰²(103-digit number)
86997717315221490983…52030815182165913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.739 × 10¹⁰³(104-digit number)
17399543463044298196…04061630364331827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.479 × 10¹⁰³(104-digit number)
34799086926088596393…08123260728663654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.959 × 10¹⁰³(104-digit number)
69598173852177192786…16246521457327308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.391 × 10¹⁰⁴(105-digit number)
13919634770435438557…32493042914654617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.783 × 10¹⁰⁴(105-digit number)
27839269540870877114…64986085829309235199
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,772,555 XPM·at block #6,816,054 · 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