Block #419,274

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 11:43:04 AM · Difficulty 10.3863 · 6,389,955 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8cc450c20678c54918c9bfafc7bba13eae32cbf6880a2962b7a9a44482707131

Height

#419,274

Difficulty

10.386339

Transactions

2

Size

780 B

Version

2

Bits

0a62e724

Nonce

28,990

Timestamp

2/25/2014, 11:43:04 AM

Confirmations

6,389,955

Merkle Root

bd31e66078c35111ab918f6f9d0adde3a063191742d81b4e0c4602449c6d62da
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.857 × 10¹⁰⁴(105-digit number)
58573118051162428190…34210913463815650799
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.857 × 10¹⁰⁴(105-digit number)
58573118051162428190…34210913463815650799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.171 × 10¹⁰⁵(106-digit number)
11714623610232485638…68421826927631301599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.342 × 10¹⁰⁵(106-digit number)
23429247220464971276…36843653855262603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.685 × 10¹⁰⁵(106-digit number)
46858494440929942552…73687307710525206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.371 × 10¹⁰⁵(106-digit number)
93716988881859885104…47374615421050412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.874 × 10¹⁰⁶(107-digit number)
18743397776371977020…94749230842100825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.748 × 10¹⁰⁶(107-digit number)
37486795552743954041…89498461684201651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.497 × 10¹⁰⁶(107-digit number)
74973591105487908083…78996923368403302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.499 × 10¹⁰⁷(108-digit number)
14994718221097581616…57993846736806604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.998 × 10¹⁰⁷(108-digit number)
29989436442195163233…15987693473613209599
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,717,895 XPM·at block #6,809,228 · 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