Block #466,025

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/29/2014, 9:16:29 PM · Difficulty 10.4232 · 6,343,923 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48dbba556ce12b60762028aff90ef2734ed8fd9abca0641230789bde156bfcec

Height

#466,025

Difficulty

10.423229

Transactions

4

Size

1.76 KB

Version

2

Bits

0a6c58b4

Nonce

32,552

Timestamp

3/29/2014, 9:16:29 PM

Confirmations

6,343,923

Merkle Root

d70030665617c90ca9dd995b6100f0962c0135b1336102b5befe2cbd7c323e2e
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.961 × 10⁹⁸(99-digit number)
59612204004473554091…56602338232835678719
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.961 × 10⁹⁸(99-digit number)
59612204004473554091…56602338232835678719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.192 × 10⁹⁹(100-digit number)
11922440800894710818…13204676465671357439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.384 × 10⁹⁹(100-digit number)
23844881601789421636…26409352931342714879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.768 × 10⁹⁹(100-digit number)
47689763203578843273…52818705862685429759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.537 × 10⁹⁹(100-digit number)
95379526407157686546…05637411725370859519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.907 × 10¹⁰⁰(101-digit number)
19075905281431537309…11274823450741719039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.815 × 10¹⁰⁰(101-digit number)
38151810562863074618…22549646901483438079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.630 × 10¹⁰⁰(101-digit number)
76303621125726149236…45099293802966876159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.526 × 10¹⁰¹(102-digit number)
15260724225145229847…90198587605933752319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.052 × 10¹⁰¹(102-digit number)
30521448450290459694…80397175211867504639
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,723,664 XPM·at block #6,809,947 · 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