Block #419,934

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/26/2014, 1:24:29 AM · Difficulty 10.3665 · 6,389,468 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
827a825d6f8d202868710243446be8c867dc315b19a585037da2d40ffa35d2f7

Height

#419,934

Difficulty

10.366537

Transactions

2

Size

4.76 KB

Version

2

Bits

0a5dd560

Nonce

189,463

Timestamp

2/26/2014, 1:24:29 AM

Confirmations

6,389,468

Merkle Root

0d06b3cac6842dfadb33e7801edc86d3e693bc5d2a8c8fddcad893a279c0990e
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.872 × 10⁹⁸(99-digit number)
58728661472196939836…96510414645320723199
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.872 × 10⁹⁸(99-digit number)
58728661472196939836…96510414645320723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.174 × 10⁹⁹(100-digit number)
11745732294439387967…93020829290641446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.349 × 10⁹⁹(100-digit number)
23491464588878775934…86041658581282892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.698 × 10⁹⁹(100-digit number)
46982929177757551869…72083317162565785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.396 × 10⁹⁹(100-digit number)
93965858355515103738…44166634325131571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.879 × 10¹⁰⁰(101-digit number)
18793171671103020747…88333268650263142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.758 × 10¹⁰⁰(101-digit number)
37586343342206041495…76666537300526284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.517 × 10¹⁰⁰(101-digit number)
75172686684412082991…53333074601052569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.503 × 10¹⁰¹(102-digit number)
15034537336882416598…06666149202105139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.006 × 10¹⁰¹(102-digit number)
30069074673764833196…13332298404210278399
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,719,290 XPM·at block #6,809,401 · 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.

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