Block #421,060

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/26/2014, 6:52:13 PM · Difficulty 10.3768 · 6,405,415 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d17152b4d4a05086c039229d47e03ea43c5d51d5ead92605fb8fe65da8594e0

Height

#421,060

Difficulty

10.376826

Transactions

2

Size

1.13 KB

Version

2

Bits

0a6077ac

Nonce

62,635

Timestamp

2/26/2014, 6:52:13 PM

Confirmations

6,405,415

Merkle Root

ccdd9c0626cfdf6046b5a2a3041fc435e315c78eaf52a42878f9e12688719d1e
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.474 × 10⁹⁶(97-digit number)
94744061460372195185…64766805476224395519
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.474 × 10⁹⁶(97-digit number)
94744061460372195185…64766805476224395519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.894 × 10⁹⁷(98-digit number)
18948812292074439037…29533610952448791039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.789 × 10⁹⁷(98-digit number)
37897624584148878074…59067221904897582079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.579 × 10⁹⁷(98-digit number)
75795249168297756148…18134443809795164159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.515 × 10⁹⁸(99-digit number)
15159049833659551229…36268887619590328319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.031 × 10⁹⁸(99-digit number)
30318099667319102459…72537775239180656639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.063 × 10⁹⁸(99-digit number)
60636199334638204918…45075550478361313279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.212 × 10⁹⁹(100-digit number)
12127239866927640983…90151100956722626559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.425 × 10⁹⁹(100-digit number)
24254479733855281967…80302201913445253119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.850 × 10⁹⁹(100-digit number)
48508959467710563935…60604403826890506239
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,855,938 XPM·at block #6,826,474 · 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