Block #401,793

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2014, 12:41:43 AM · Difficulty 10.4322 · 6,413,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd7d4b8b61d23689da95fc038df3cdcd99d99a15dd8662f07033aa9ed342224f

Height

#401,793

Difficulty

10.432187

Transactions

10

Size

4.20 KB

Version

2

Bits

0a6ea3d5

Nonce

144,065

Timestamp

2/13/2014, 12:41:43 AM

Confirmations

6,413,272

Merkle Root

5de23e46204ec04184e373bda768dfb4618a59a2f1a387301c3b9677120a5d96
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.

6.003 × 10⁹⁴(95-digit number)
60035693895760938327…68462918570898959999
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
6.003 × 10⁹⁴(95-digit number)
60035693895760938327…68462918570898959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.200 × 10⁹⁵(96-digit number)
12007138779152187665…36925837141797919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.401 × 10⁹⁵(96-digit number)
24014277558304375330…73851674283595839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.802 × 10⁹⁵(96-digit number)
48028555116608750661…47703348567191679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.605 × 10⁹⁵(96-digit number)
96057110233217501323…95406697134383359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.921 × 10⁹⁶(97-digit number)
19211422046643500264…90813394268766719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.842 × 10⁹⁶(97-digit number)
38422844093287000529…81626788537533439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.684 × 10⁹⁶(97-digit number)
76845688186574001058…63253577075066879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.536 × 10⁹⁷(98-digit number)
15369137637314800211…26507154150133759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.073 × 10⁹⁷(98-digit number)
30738275274629600423…53014308300267519999
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,764,612 XPM·at block #6,815,064 · 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