Block #430,527

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/5/2014, 1:36:59 PM · Difficulty 10.3441 · 6,384,612 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a04a55efd3c8369e2455106f5c29f00cfc1b2dee2d80faafc867483243c95c8c

Height

#430,527

Difficulty

10.344066

Transactions

2

Size

1.08 KB

Version

2

Bits

0a5814b7

Nonce

234,942

Timestamp

3/5/2014, 1:36:59 PM

Confirmations

6,384,612

Merkle Root

a871ecba89bf6d7ed449b6f6b6eeee75da1ba3c63e5c5f7f267342546987ec9a
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.617 × 10⁹⁷(98-digit number)
26172002818330340647…53664531811834762239
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.617 × 10⁹⁷(98-digit number)
26172002818330340647…53664531811834762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.234 × 10⁹⁷(98-digit number)
52344005636660681295…07329063623669524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.046 × 10⁹⁸(99-digit number)
10468801127332136259…14658127247339048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.093 × 10⁹⁸(99-digit number)
20937602254664272518…29316254494678097919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.187 × 10⁹⁸(99-digit number)
41875204509328545036…58632508989356195839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.375 × 10⁹⁸(99-digit number)
83750409018657090072…17265017978712391679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.675 × 10⁹⁹(100-digit number)
16750081803731418014…34530035957424783359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.350 × 10⁹⁹(100-digit number)
33500163607462836029…69060071914849566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.700 × 10⁹⁹(100-digit number)
67000327214925672058…38120143829699133439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.340 × 10¹⁰⁰(101-digit number)
13400065442985134411…76240287659398266879
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,765,205 XPM·at block #6,815,138 · 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