Block #430,800

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/5/2014, 5:44:46 PM · Difficulty 10.3475 · 6,387,136 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
11cfd7efe29922646bb0ddd810d1c7c57c4d981652cd807a04e9811c457f5378

Height

#430,800

Difficulty

10.347486

Transactions

7

Size

1.52 KB

Version

2

Bits

0a58f4dc

Nonce

581,086

Timestamp

3/5/2014, 5:44:46 PM

Confirmations

6,387,136

Merkle Root

1658d87cfbacfb789de7baf6dc60c94dd7f562627206262c61b7d0c03ef5d75f
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.689 × 10⁹⁷(98-digit number)
16892005255512372049…58713733831920756959
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.689 × 10⁹⁷(98-digit number)
16892005255512372049…58713733831920756959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.378 × 10⁹⁷(98-digit number)
33784010511024744099…17427467663841513919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.756 × 10⁹⁷(98-digit number)
67568021022049488198…34854935327683027839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.351 × 10⁹⁸(99-digit number)
13513604204409897639…69709870655366055679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.702 × 10⁹⁸(99-digit number)
27027208408819795279…39419741310732111359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.405 × 10⁹⁸(99-digit number)
54054416817639590558…78839482621464222719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.081 × 10⁹⁹(100-digit number)
10810883363527918111…57678965242928445439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.162 × 10⁹⁹(100-digit number)
21621766727055836223…15357930485856890879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.324 × 10⁹⁹(100-digit number)
43243533454111672446…30715860971713781759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.648 × 10⁹⁹(100-digit number)
86487066908223344893…61431721943427563519
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,787,553 XPM·at block #6,817,935 · 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