Block #454,305

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 8:31:29 PM · Difficulty 10.3973 · 6,372,805 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
138e1f5fa5b489d48f4b602fd530e91441042080e163e639aeff9a8a83598844

Height

#454,305

Difficulty

10.397300

Transactions

1

Size

1.02 KB

Version

2

Bits

0a65b56e

Nonce

6,018

Timestamp

3/21/2014, 8:31:29 PM

Confirmations

6,372,805

Merkle Root

e9d9c7d94b0dc68894bf990d01f8a4bd6f43da1a49fe332b8823d81f8e8823e7
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.

5.001 × 10¹⁰²(103-digit number)
50017156394069768845…61916973814185833759
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
5.001 × 10¹⁰²(103-digit number)
50017156394069768845…61916973814185833759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.000 × 10¹⁰³(104-digit number)
10003431278813953769…23833947628371667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.000 × 10¹⁰³(104-digit number)
20006862557627907538…47667895256743335039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.001 × 10¹⁰³(104-digit number)
40013725115255815076…95335790513486670079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.002 × 10¹⁰³(104-digit number)
80027450230511630153…90671581026973340159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.600 × 10¹⁰⁴(105-digit number)
16005490046102326030…81343162053946680319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.201 × 10¹⁰⁴(105-digit number)
32010980092204652061…62686324107893360639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.402 × 10¹⁰⁴(105-digit number)
64021960184409304122…25372648215786721279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.280 × 10¹⁰⁵(106-digit number)
12804392036881860824…50745296431573442559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.560 × 10¹⁰⁵(106-digit number)
25608784073763721649…01490592863146885119
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,861,059 XPM·at block #6,827,109 · 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