Block #451,857

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 6:00:56 AM · Difficulty 10.3794 · 6,365,417 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
860b9726c1b204310ec4953bd94ee5457de1c7b90c40abd5d138d41d58e7b528

Height

#451,857

Difficulty

10.379353

Transactions

2

Size

1.36 KB

Version

2

Bits

0a611d40

Nonce

161,739

Timestamp

3/20/2014, 6:00:56 AM

Confirmations

6,365,417

Merkle Root

14a3c5bba8a2242dc91f144813071941c6ccaef513cfae5528d5191d83ef9e8e
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.

2.234 × 10⁹⁵(96-digit number)
22346714099392078285…74886488887737808599
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
2.234 × 10⁹⁵(96-digit number)
22346714099392078285…74886488887737808599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.469 × 10⁹⁵(96-digit number)
44693428198784156570…49772977775475617199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.938 × 10⁹⁵(96-digit number)
89386856397568313140…99545955550951234399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.787 × 10⁹⁶(97-digit number)
17877371279513662628…99091911101902468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.575 × 10⁹⁶(97-digit number)
35754742559027325256…98183822203804937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.150 × 10⁹⁶(97-digit number)
71509485118054650512…96367644407609875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.430 × 10⁹⁷(98-digit number)
14301897023610930102…92735288815219750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.860 × 10⁹⁷(98-digit number)
28603794047221860205…85470577630439500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.720 × 10⁹⁷(98-digit number)
57207588094443720410…70941155260879001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.144 × 10⁹⁸(99-digit number)
11441517618888744082…41882310521758003199
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,782,230 XPM·at block #6,817,273 · 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