Block #420,616

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/26/2014, 12:07:13 PM · Difficulty 10.3721 · 6,392,036 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b65fbb6509e443c69f0656f2176f2bb16eebd71111676687e46abb0c880339ae

Height

#420,616

Difficulty

10.372134

Transactions

2

Size

1.10 KB

Version

2

Bits

0a5f442c

Nonce

208,897

Timestamp

2/26/2014, 12:07:13 PM

Confirmations

6,392,036

Merkle Root

5bcea4c7e370ae9d839570827a81fe2380a0c4f0dddfed60258dadf88053d6e3
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.169 × 10⁹⁹(100-digit number)
41693083266632354838…93214007837806926399
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.169 × 10⁹⁹(100-digit number)
41693083266632354838…93214007837806926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.338 × 10⁹⁹(100-digit number)
83386166533264709677…86428015675613852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.667 × 10¹⁰⁰(101-digit number)
16677233306652941935…72856031351227705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.335 × 10¹⁰⁰(101-digit number)
33354466613305883870…45712062702455411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.670 × 10¹⁰⁰(101-digit number)
66708933226611767741…91424125404910822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.334 × 10¹⁰¹(102-digit number)
13341786645322353548…82848250809821644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.668 × 10¹⁰¹(102-digit number)
26683573290644707096…65696501619643289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.336 × 10¹⁰¹(102-digit number)
53367146581289414193…31393003239286579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.067 × 10¹⁰²(103-digit number)
10673429316257882838…62786006478573158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.134 × 10¹⁰²(103-digit number)
21346858632515765677…25572012957146316799
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,745,245 XPM·at block #6,812,651 · 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