Block #421,862

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/27/2014, 8:25:33 AM · Difficulty 10.3756 · 6,393,081 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8f4a93b6e51cd02d49d61dbe6f078b25c4e7428250c4d71714a97b3f693a5177

Height

#421,862

Difficulty

10.375637

Transactions

2

Size

555 B

Version

2

Bits

0a6029b7

Nonce

556,412

Timestamp

2/27/2014, 8:25:33 AM

Confirmations

6,393,081

Merkle Root

0c43ea43c9187db147a56d0edad8b9bdb157a399ea591641504ed45d9840b3a0
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.

3.703 × 10¹⁰⁰(101-digit number)
37037179486504437082…86019468800300774799
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
3.703 × 10¹⁰⁰(101-digit number)
37037179486504437082…86019468800300774799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.407 × 10¹⁰⁰(101-digit number)
74074358973008874164…72038937600601549599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.481 × 10¹⁰¹(102-digit number)
14814871794601774832…44077875201203099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.962 × 10¹⁰¹(102-digit number)
29629743589203549665…88155750402406198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.925 × 10¹⁰¹(102-digit number)
59259487178407099331…76311500804812396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.185 × 10¹⁰²(103-digit number)
11851897435681419866…52623001609624793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.370 × 10¹⁰²(103-digit number)
23703794871362839732…05246003219249587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.740 × 10¹⁰²(103-digit number)
47407589742725679465…10492006438499174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.481 × 10¹⁰²(103-digit number)
94815179485451358930…20984012876998348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.896 × 10¹⁰³(104-digit number)
18963035897090271786…41968025753996697599
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,763,640 XPM·at block #6,814,942 · 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