Block #406,522

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 7:53:19 AM · Difficulty 10.4315 · 6,403,025 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
244e869447c20dc97266dfb3bf6a9de3b40dc5a9d6e836605efe72510b8bd31e

Height

#406,522

Difficulty

10.431513

Transactions

10

Size

5.77 KB

Version

2

Bits

0a6e77a4

Nonce

11,008

Timestamp

2/16/2014, 7:53:19 AM

Confirmations

6,403,025

Merkle Root

1b6c6ae23a6b9bf8a573e433243dc4fad1f8aaa82395200d7ad2ec4d3ef47832
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.

1.848 × 10¹⁰³(104-digit number)
18489022346697126758…86957620105770261759
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
1.848 × 10¹⁰³(104-digit number)
18489022346697126758…86957620105770261759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.697 × 10¹⁰³(104-digit number)
36978044693394253517…73915240211540523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.395 × 10¹⁰³(104-digit number)
73956089386788507035…47830480423081047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.479 × 10¹⁰⁴(105-digit number)
14791217877357701407…95660960846162094079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.958 × 10¹⁰⁴(105-digit number)
29582435754715402814…91321921692324188159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.916 × 10¹⁰⁴(105-digit number)
59164871509430805628…82643843384648376319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.183 × 10¹⁰⁵(106-digit number)
11832974301886161125…65287686769296752639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.366 × 10¹⁰⁵(106-digit number)
23665948603772322251…30575373538593505279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.733 × 10¹⁰⁵(106-digit number)
47331897207544644502…61150747077187010559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.466 × 10¹⁰⁵(106-digit number)
94663794415089289004…22301494154374021119
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,720,449 XPM·at block #6,809,546 · 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