Block #418,890

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 5:30:18 AM · Difficulty 10.3835 · 6,395,154 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a98e8b06a9323c547e141ebfcb634962b841d7ac34423f7edbf4ddc665ac0daf

Height

#418,890

Difficulty

10.383534

Transactions

2

Size

2.02 KB

Version

2

Bits

0a622f43

Nonce

12,588

Timestamp

2/25/2014, 5:30:18 AM

Confirmations

6,395,154

Merkle Root

9e58a3ceccc327431d136bd3ce68e271d4f0bf10c27a5a4eddd64c41d49c12be
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.

8.401 × 10⁹⁸(99-digit number)
84017084472931246363…30369244437567385599
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
8.401 × 10⁹⁸(99-digit number)
84017084472931246363…30369244437567385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.680 × 10⁹⁹(100-digit number)
16803416894586249272…60738488875134771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.360 × 10⁹⁹(100-digit number)
33606833789172498545…21476977750269542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.721 × 10⁹⁹(100-digit number)
67213667578344997091…42953955500539084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.344 × 10¹⁰⁰(101-digit number)
13442733515668999418…85907911001078169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.688 × 10¹⁰⁰(101-digit number)
26885467031337998836…71815822002156339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.377 × 10¹⁰⁰(101-digit number)
53770934062675997672…43631644004312678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.075 × 10¹⁰¹(102-digit number)
10754186812535199534…87263288008625356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.150 × 10¹⁰¹(102-digit number)
21508373625070399069…74526576017250713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.301 × 10¹⁰¹(102-digit number)
43016747250140798138…49053152034501427199
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,427 XPM·at block #6,814,043 · 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