Block #418,408

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/24/2014, 8:41:27 PM · Difficulty 10.3900 · 6,391,286 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2feef5ec8381c6a09b24291c39435de34b9d55ea6c57e8246817297401988fe5

Height

#418,408

Difficulty

10.390009

Transactions

5

Size

1.08 KB

Version

2

Bits

0a63d7a5

Nonce

81,180

Timestamp

2/24/2014, 8:41:27 PM

Confirmations

6,391,286

Merkle Root

90bcf6bb0aec16adc4eae43c8ffbf4b4937bbf9deb0ee5b9c3df98f263446ec6
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.

4.913 × 10¹⁰²(103-digit number)
49132663869544593813…48376168419159452639
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
4.913 × 10¹⁰²(103-digit number)
49132663869544593813…48376168419159452639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.826 × 10¹⁰²(103-digit number)
98265327739089187626…96752336838318905279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.965 × 10¹⁰³(104-digit number)
19653065547817837525…93504673676637810559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.930 × 10¹⁰³(104-digit number)
39306131095635675050…87009347353275621119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.861 × 10¹⁰³(104-digit number)
78612262191271350101…74018694706551242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.572 × 10¹⁰⁴(105-digit number)
15722452438254270020…48037389413102484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.144 × 10¹⁰⁴(105-digit number)
31444904876508540040…96074778826204968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.288 × 10¹⁰⁴(105-digit number)
62889809753017080081…92149557652409937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.257 × 10¹⁰⁵(106-digit number)
12577961950603416016…84299115304819875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.515 × 10¹⁰⁵(106-digit number)
25155923901206832032…68598230609639751679
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,721,629 XPM·at block #6,809,693 · 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