Block #423,557

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/28/2014, 12:50:51 PM · Difficulty 10.3749 · 6,389,092 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f93dc6db52d06f2705d0b9713b475ff382223037f86260d21ffaa86a2f0bc2c8

Height

#423,557

Difficulty

10.374878

Transactions

3

Size

654 B

Version

2

Bits

0a5ff809

Nonce

13,987

Timestamp

2/28/2014, 12:50:51 PM

Confirmations

6,389,092

Merkle Root

604e78cc173067f2173dd9e2e016931ce9b48f5c38fd8bdb52b755a1c948281b
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.

1.567 × 10⁹⁸(99-digit number)
15676520985521240003…61980471806710017559
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
1.567 × 10⁹⁸(99-digit number)
15676520985521240003…61980471806710017559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.135 × 10⁹⁸(99-digit number)
31353041971042480007…23960943613420035119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.270 × 10⁹⁸(99-digit number)
62706083942084960014…47921887226840070239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.254 × 10⁹⁹(100-digit number)
12541216788416992002…95843774453680140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.508 × 10⁹⁹(100-digit number)
25082433576833984005…91687548907360280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.016 × 10⁹⁹(100-digit number)
50164867153667968011…83375097814720561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.003 × 10¹⁰⁰(101-digit number)
10032973430733593602…66750195629441123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.006 × 10¹⁰⁰(101-digit number)
20065946861467187204…33500391258882247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.013 × 10¹⁰⁰(101-digit number)
40131893722934374409…67000782517764495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.026 × 10¹⁰⁰(101-digit number)
80263787445868748818…34001565035528990719
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,745,221 XPM·at block #6,812,648 · 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