Block #411,536

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2014, 8:10:00 PM · Difficulty 10.4288 · 6,415,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b8b1aa0bcdf9a5561dd3f4894f928a979d752621cd7211276015b3849ba619a5

Height

#411,536

Difficulty

10.428808

Transactions

3

Size

653 B

Version

2

Bits

0a6dc660

Nonce

69,647

Timestamp

2/19/2014, 8:10:00 PM

Confirmations

6,415,190

Merkle Root

4429bb699e29e4078a55b4f14263ecd38b64a4e3d830d3e15b42ab327c272635
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.

9.162 × 10⁹⁷(98-digit number)
91620319728132228394…49693537404611608959
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
9.162 × 10⁹⁷(98-digit number)
91620319728132228394…49693537404611608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.832 × 10⁹⁸(99-digit number)
18324063945626445678…99387074809223217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.664 × 10⁹⁸(99-digit number)
36648127891252891357…98774149618446435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.329 × 10⁹⁸(99-digit number)
73296255782505782715…97548299236892871679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.465 × 10⁹⁹(100-digit number)
14659251156501156543…95096598473785743359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.931 × 10⁹⁹(100-digit number)
29318502313002313086…90193196947571486719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.863 × 10⁹⁹(100-digit number)
58637004626004626172…80386393895142973439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.172 × 10¹⁰⁰(101-digit number)
11727400925200925234…60772787790285946879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.345 × 10¹⁰⁰(101-digit number)
23454801850401850469…21545575580571893759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.690 × 10¹⁰⁰(101-digit number)
46909603700803700938…43091151161143787519
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,857,961 XPM·at block #6,826,725 · 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