Block #453,551

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 9:30:53 AM · Difficulty 10.3856 · 6,356,574 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
78df48436aa844adcbb57936ec3c9006009a98fdc2ef98dfb86381bce344388b

Height

#453,551

Difficulty

10.385579

Transactions

18

Size

4.67 KB

Version

2

Bits

0a62b552

Nonce

5,043

Timestamp

3/21/2014, 9:30:53 AM

Confirmations

6,356,574

Merkle Root

f5a7a51c33c85451e24442fe92a1209fbf9f7d8e2fda255149d990cf76b7601c
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.164 × 10¹⁰³(104-digit number)
11643511372434328646…28837701042432403199
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.164 × 10¹⁰³(104-digit number)
11643511372434328646…28837701042432403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.328 × 10¹⁰³(104-digit number)
23287022744868657293…57675402084864806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.657 × 10¹⁰³(104-digit number)
46574045489737314586…15350804169729612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.314 × 10¹⁰³(104-digit number)
93148090979474629173…30701608339459225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.862 × 10¹⁰⁴(105-digit number)
18629618195894925834…61403216678918451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.725 × 10¹⁰⁴(105-digit number)
37259236391789851669…22806433357836902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.451 × 10¹⁰⁴(105-digit number)
74518472783579703338…45612866715673804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.490 × 10¹⁰⁵(106-digit number)
14903694556715940667…91225733431347609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.980 × 10¹⁰⁵(106-digit number)
29807389113431881335…82451466862695219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.961 × 10¹⁰⁵(106-digit number)
59614778226863762670…64902933725390438399
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,725,073 XPM·at block #6,810,124 · 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