Block #407,950

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/17/2014, 8:05:20 AM · Difficulty 10.4291 · 6,408,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4256b24cb408e94a51d0704cd1dc1f5fc74a9b87dbf66416b0815a74f7a6c6ba

Height

#407,950

Difficulty

10.429107

Transactions

3

Size

2.87 KB

Version

2

Bits

0a6dd9f4

Nonce

285,398

Timestamp

2/17/2014, 8:05:20 AM

Confirmations

6,408,734

Merkle Root

bc06c0e0826926ca86fe94cb67137425b6b60100bfa823ca963277b175eeb258
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.589 × 10⁹⁸(99-digit number)
35898298661612386299…67113211147896462399
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.589 × 10⁹⁸(99-digit number)
35898298661612386299…67113211147896462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.179 × 10⁹⁸(99-digit number)
71796597323224772599…34226422295792924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.435 × 10⁹⁹(100-digit number)
14359319464644954519…68452844591585849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.871 × 10⁹⁹(100-digit number)
28718638929289909039…36905689183171699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.743 × 10⁹⁹(100-digit number)
57437277858579818079…73811378366343398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.148 × 10¹⁰⁰(101-digit number)
11487455571715963615…47622756732686796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.297 × 10¹⁰⁰(101-digit number)
22974911143431927231…95245513465373593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.594 × 10¹⁰⁰(101-digit number)
45949822286863854463…90491026930747187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.189 × 10¹⁰⁰(101-digit number)
91899644573727708927…80982053861494374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.837 × 10¹⁰¹(102-digit number)
18379928914745541785…61964107722988748799
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,777,592 XPM·at block #6,816,683 · 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