Block #437,678

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 11:29:45 AM · Difficulty 10.3581 · 6,378,892 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b7b9e7ca31751ec21f1c3f20f52a0a75019d974e3852794266d2d1d121b10077

Height

#437,678

Difficulty

10.358144

Transactions

2

Size

2.45 KB

Version

2

Bits

0a5baf52

Nonce

32,968

Timestamp

3/10/2014, 11:29:45 AM

Confirmations

6,378,892

Merkle Root

db8e3d590129743b681eebf1d37aad8572872804917aa2c93b8927a699365242
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.

6.933 × 10⁹⁸(99-digit number)
69334649976526749029…78710199537697350399
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
6.933 × 10⁹⁸(99-digit number)
69334649976526749029…78710199537697350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.386 × 10⁹⁹(100-digit number)
13866929995305349805…57420399075394700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.773 × 10⁹⁹(100-digit number)
27733859990610699611…14840798150789401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.546 × 10⁹⁹(100-digit number)
55467719981221399223…29681596301578803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.109 × 10¹⁰⁰(101-digit number)
11093543996244279844…59363192603157606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.218 × 10¹⁰⁰(101-digit number)
22187087992488559689…18726385206315212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.437 × 10¹⁰⁰(101-digit number)
44374175984977119378…37452770412630425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.874 × 10¹⁰⁰(101-digit number)
88748351969954238757…74905540825260851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.774 × 10¹⁰¹(102-digit number)
17749670393990847751…49811081650521702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.549 × 10¹⁰¹(102-digit number)
35499340787981695503…99622163301043404799
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,776,692 XPM·at block #6,816,569 · 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