Block #421,144

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/26/2014, 9:28:20 PM · Difficulty 10.3753 · 6,396,029 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56fc2cd1f546ffdb7d633feca059da32cad1f7a3861588e1ca6244068be00bf1

Height

#421,144

Difficulty

10.375304

Transactions

7

Size

4.12 KB

Version

2

Bits

0a6013f4

Nonce

53,521

Timestamp

2/26/2014, 9:28:20 PM

Confirmations

6,396,029

Merkle Root

f9bbc0af6130481054c8ee8f9be6413196a30f4876d11f3e1654bc5942ec07f2
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.516 × 10¹⁰²(103-digit number)
55168945061602728978…30045267102249758719
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.516 × 10¹⁰²(103-digit number)
55168945061602728978…30045267102249758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.103 × 10¹⁰³(104-digit number)
11033789012320545795…60090534204499517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.206 × 10¹⁰³(104-digit number)
22067578024641091591…20181068408999034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.413 × 10¹⁰³(104-digit number)
44135156049282183183…40362136817998069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.827 × 10¹⁰³(104-digit number)
88270312098564366366…80724273635996139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.765 × 10¹⁰⁴(105-digit number)
17654062419712873273…61448547271992279039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.530 × 10¹⁰⁴(105-digit number)
35308124839425746546…22897094543984558079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.061 × 10¹⁰⁴(105-digit number)
70616249678851493092…45794189087969116159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.412 × 10¹⁰⁵(106-digit number)
14123249935770298618…91588378175938232319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.824 × 10¹⁰⁵(106-digit number)
28246499871540597237…83176756351876464639
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,781,419 XPM·at block #6,817,172 · 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