Block #436,557

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2014, 4:24:59 PM · Difficulty 10.3601 · 6,380,251 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d1505c481fe727dad8909fa123518de98234aa57d1d0a64a685e0af2ce8cd3aa

Height

#436,557

Difficulty

10.360064

Transactions

6

Size

1.31 KB

Version

2

Bits

0a5c2d29

Nonce

340,184

Timestamp

3/9/2014, 4:24:59 PM

Confirmations

6,380,251

Merkle Root

f531ead15aa71d1b7a18d14e9f8205eea94f130ca2ee70631c6ea93159b09ce5
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.301 × 10¹⁰²(103-digit number)
33016131235571918095…33337266784227219839
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.301 × 10¹⁰²(103-digit number)
33016131235571918095…33337266784227219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.603 × 10¹⁰²(103-digit number)
66032262471143836190…66674533568454439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.320 × 10¹⁰³(104-digit number)
13206452494228767238…33349067136908879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.641 × 10¹⁰³(104-digit number)
26412904988457534476…66698134273817758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.282 × 10¹⁰³(104-digit number)
52825809976915068952…33396268547635517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.056 × 10¹⁰⁴(105-digit number)
10565161995383013790…66792537095271034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.113 × 10¹⁰⁴(105-digit number)
21130323990766027580…33585074190542069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.226 × 10¹⁰⁴(105-digit number)
42260647981532055161…67170148381084139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.452 × 10¹⁰⁴(105-digit number)
84521295963064110323…34340296762168279039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.690 × 10¹⁰⁵(106-digit number)
16904259192612822064…68680593524336558079
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,778,501 XPM·at block #6,816,807 · 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