Block #453,971

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 3:25:10 PM · Difficulty 10.3943 · 6,362,283 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a52b1f9273e3de7da05243261e7f61f141914e776f9989afc0e4d108215d8eb6

Height

#453,971

Difficulty

10.394336

Transactions

2

Size

428 B

Version

2

Bits

0a64f33b

Nonce

11,864

Timestamp

3/21/2014, 3:25:10 PM

Confirmations

6,362,283

Merkle Root

090eccea43b9e50b5c8d9a08966a4274c47d78c38d968ac70ab8ab4d2aa33cce
Transactions (2)
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.

6.248 × 10⁹⁷(98-digit number)
62485305700630350716…46300821134030488679
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
6.248 × 10⁹⁷(98-digit number)
62485305700630350716…46300821134030488679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.249 × 10⁹⁸(99-digit number)
12497061140126070143…92601642268060977359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.499 × 10⁹⁸(99-digit number)
24994122280252140286…85203284536121954719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.998 × 10⁹⁸(99-digit number)
49988244560504280573…70406569072243909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.997 × 10⁹⁸(99-digit number)
99976489121008561146…40813138144487818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.999 × 10⁹⁹(100-digit number)
19995297824201712229…81626276288975637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.999 × 10⁹⁹(100-digit number)
39990595648403424458…63252552577951275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.998 × 10⁹⁹(100-digit number)
79981191296806848917…26505105155902551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.599 × 10¹⁰⁰(101-digit number)
15996238259361369783…53010210311805102079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.199 × 10¹⁰⁰(101-digit number)
31992476518722739566…06020420623610204159
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,774,152 XPM·at block #6,816,253 · 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