Block #434,290

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 4:45:41 AM · Difficulty 10.3422 · 6,379,727 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
698662bd3264224c944821724a82f45def8375b29c733aa0c880f8bab390880f

Height

#434,290

Difficulty

10.342157

Transactions

4

Size

1.51 KB

Version

2

Bits

0a57979b

Nonce

203,856

Timestamp

3/8/2014, 4:45:41 AM

Confirmations

6,379,727

Merkle Root

61af90058f0eb72386e8f6ba76bcd53ed0cb2d0c860859dda29045ef0ec9c5ea
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.

9.244 × 10⁹⁸(99-digit number)
92441816578735336818…95457923557745603199
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
9.244 × 10⁹⁸(99-digit number)
92441816578735336818…95457923557745603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.848 × 10⁹⁹(100-digit number)
18488363315747067363…90915847115491206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.697 × 10⁹⁹(100-digit number)
36976726631494134727…81831694230982412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.395 × 10⁹⁹(100-digit number)
73953453262988269455…63663388461964825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.479 × 10¹⁰⁰(101-digit number)
14790690652597653891…27326776923929651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.958 × 10¹⁰⁰(101-digit number)
29581381305195307782…54653553847859302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.916 × 10¹⁰⁰(101-digit number)
59162762610390615564…09307107695718604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.183 × 10¹⁰¹(102-digit number)
11832552522078123112…18614215391437209599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.366 × 10¹⁰¹(102-digit number)
23665105044156246225…37228430782874419199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.733 × 10¹⁰¹(102-digit number)
47330210088312492451…74456861565748838399
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,756,220 XPM·at block #6,814,016 · 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