Block #428,009

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/3/2014, 6:45:15 PM · Difficulty 10.3494 · 6,398,746 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b53abb6af342d422f3341f8fa2476f5cdf45a2f8e39bf90ac667ee46ab7ebd77

Height

#428,009

Difficulty

10.349364

Transactions

2

Size

1.04 KB

Version

2

Bits

0a596feb

Nonce

988,311

Timestamp

3/3/2014, 6:45:15 PM

Confirmations

6,398,746

Merkle Root

46224158c4c953c964bb4621a59d423d9596623160065aac1392add97493385d
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.

4.598 × 10¹⁰¹(102-digit number)
45982833961759589458…88522284667842651199
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
4.598 × 10¹⁰¹(102-digit number)
45982833961759589458…88522284667842651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.196 × 10¹⁰¹(102-digit number)
91965667923519178917…77044569335685302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.839 × 10¹⁰²(103-digit number)
18393133584703835783…54089138671370604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.678 × 10¹⁰²(103-digit number)
36786267169407671566…08178277342741209599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.357 × 10¹⁰²(103-digit number)
73572534338815343133…16356554685482419199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.471 × 10¹⁰³(104-digit number)
14714506867763068626…32713109370964838399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.942 × 10¹⁰³(104-digit number)
29429013735526137253…65426218741929676799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.885 × 10¹⁰³(104-digit number)
58858027471052274506…30852437483859353599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.177 × 10¹⁰⁴(105-digit number)
11771605494210454901…61704874967718707199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.354 × 10¹⁰⁴(105-digit number)
23543210988420909802…23409749935437414399
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,858,198 XPM·at block #6,826,754 · 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