Block #429,486

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2014, 7:56:21 PM · Difficulty 10.3461 · 6,381,411 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
08c437f5824e02e0381e6fc8851e66efd455747d180358f31f21b474326779ac

Height

#429,486

Difficulty

10.346133

Transactions

2

Size

401 B

Version

2

Bits

0a589c24

Nonce

19,248

Timestamp

3/4/2014, 7:56:21 PM

Confirmations

6,381,411

Merkle Root

c6a27665877bd5c6bc978baed9d66d6d0ad7b370fdf50db29e5d9301cc9b1e7a
Transactions (2)
1 in → 1 out9.3464 XPM116 B
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.

2.633 × 10¹⁰⁵(106-digit number)
26338493627542452877…94356113600471012159
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
2.633 × 10¹⁰⁵(106-digit number)
26338493627542452877…94356113600471012159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.267 × 10¹⁰⁵(106-digit number)
52676987255084905755…88712227200942024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.053 × 10¹⁰⁶(107-digit number)
10535397451016981151…77424454401884048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.107 × 10¹⁰⁶(107-digit number)
21070794902033962302…54848908803768097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.214 × 10¹⁰⁶(107-digit number)
42141589804067924604…09697817607536194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.428 × 10¹⁰⁶(107-digit number)
84283179608135849208…19395635215072389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.685 × 10¹⁰⁷(108-digit number)
16856635921627169841…38791270430144778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.371 × 10¹⁰⁷(108-digit number)
33713271843254339683…77582540860289556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.742 × 10¹⁰⁷(108-digit number)
67426543686508679366…55165081720579112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.348 × 10¹⁰⁸(109-digit number)
13485308737301735873…10330163441158225919
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,731,274 XPM·at block #6,810,896 · 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