Block #435,137

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 5:09:25 PM · Difficulty 10.3564 · 6,374,513 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f11f97d17900ce0d77ffe1281b235a76f68a11ef1c212017c3205be82d394e6c

Height

#435,137

Difficulty

10.356370

Transactions

4

Size

5.41 KB

Version

2

Bits

0a5b3b12

Nonce

73,643

Timestamp

3/8/2014, 5:09:25 PM

Confirmations

6,374,513

Merkle Root

226a7fb3ebaff544dbaff6d072adc8838d96fd17a9c4a795dfa8f08aea0189c1
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.478 × 10⁹⁹(100-digit number)
24789496711894140142…12388106179233710079
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.478 × 10⁹⁹(100-digit number)
24789496711894140142…12388106179233710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.957 × 10⁹⁹(100-digit number)
49578993423788280284…24776212358467420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.915 × 10⁹⁹(100-digit number)
99157986847576560568…49552424716934840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.983 × 10¹⁰⁰(101-digit number)
19831597369515312113…99104849433869680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.966 × 10¹⁰⁰(101-digit number)
39663194739030624227…98209698867739361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.932 × 10¹⁰⁰(101-digit number)
79326389478061248454…96419397735478722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.586 × 10¹⁰¹(102-digit number)
15865277895612249690…92838795470957445119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.173 × 10¹⁰¹(102-digit number)
31730555791224499381…85677590941914890239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.346 × 10¹⁰¹(102-digit number)
63461111582448998763…71355181883829780479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.269 × 10¹⁰²(103-digit number)
12692222316489799752…42710363767659560959
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,721,281 XPM·at block #6,809,649 · 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