Block #460,553

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 2:36:53 AM · Difficulty 10.4166 · 6,347,709 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
599d623f67122caf5e99e3d4a2617e16c86346a8ce51fe9c1ae195272a3bfa90

Height

#460,553

Difficulty

10.416595

Transactions

3

Size

858 B

Version

2

Bits

0a6aa600

Nonce

89,364

Timestamp

3/26/2014, 2:36:53 AM

Confirmations

6,347,709

Merkle Root

542f42d3d64e75b6d63173fefc5291b3c078231b5fc1f0f351b5bf311920b62b
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.792 × 10⁹⁹(100-digit number)
67921387476878723138…73308495601241281279
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.792 × 10⁹⁹(100-digit number)
67921387476878723138…73308495601241281279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.358 × 10¹⁰⁰(101-digit number)
13584277495375744627…46616991202482562559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.716 × 10¹⁰⁰(101-digit number)
27168554990751489255…93233982404965125119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.433 × 10¹⁰⁰(101-digit number)
54337109981502978510…86467964809930250239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.086 × 10¹⁰¹(102-digit number)
10867421996300595702…72935929619860500479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.173 × 10¹⁰¹(102-digit number)
21734843992601191404…45871859239721000959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.346 × 10¹⁰¹(102-digit number)
43469687985202382808…91743718479442001919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.693 × 10¹⁰¹(102-digit number)
86939375970404765617…83487436958884003839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.738 × 10¹⁰²(103-digit number)
17387875194080953123…66974873917768007679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.477 × 10¹⁰²(103-digit number)
34775750388161906246…33949747835536015359
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,710,143 XPM·at block #6,808,261 · 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