Block #405,540

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2014, 3:33:30 PM · Difficulty 10.4308 · 6,404,987 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e2a2316a12f92d4beb15a26023cee189acb8402aebd916ddc1020c915e9ecfd

Height

#405,540

Difficulty

10.430826

Transactions

7

Size

1.67 KB

Version

2

Bits

0a6e4aa3

Nonce

215,093

Timestamp

2/15/2014, 3:33:30 PM

Confirmations

6,404,987

Merkle Root

2eaf130f361727cb1470e98c0aa68a4c470331594d3fe9acfe533dde48ab2b2b
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.

8.876 × 10¹⁰⁰(101-digit number)
88761251403848166389…27210734609994874879
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
8.876 × 10¹⁰⁰(101-digit number)
88761251403848166389…27210734609994874879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.775 × 10¹⁰¹(102-digit number)
17752250280769633277…54421469219989749759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.550 × 10¹⁰¹(102-digit number)
35504500561539266555…08842938439979499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.100 × 10¹⁰¹(102-digit number)
71009001123078533111…17685876879958999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.420 × 10¹⁰²(103-digit number)
14201800224615706622…35371753759917998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.840 × 10¹⁰²(103-digit number)
28403600449231413244…70743507519835996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.680 × 10¹⁰²(103-digit number)
56807200898462826489…41487015039671992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.136 × 10¹⁰³(104-digit number)
11361440179692565297…82974030079343984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.272 × 10¹⁰³(104-digit number)
22722880359385130595…65948060158687969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.544 × 10¹⁰³(104-digit number)
45445760718770261191…31896120317375938559
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,728,303 XPM·at block #6,810,526 · 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