Block #470,032

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/1/2014, 3:18:26 PM · Difficulty 10.4310 · 6,342,128 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b479548d6d7e199cf5c3437a75308224e09f51503f1131fa6d720441a9dfcb2d

Height

#470,032

Difficulty

10.430993

Transactions

4

Size

1.33 KB

Version

2

Bits

0a6e5592

Nonce

161,743

Timestamp

4/1/2014, 3:18:26 PM

Confirmations

6,342,128

Merkle Root

584a110c4434e1ada5bb8314da585ae371eb4ed6bf53aa6567573dbb24c8e33b
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.

2.551 × 10¹⁰⁰(101-digit number)
25514238576634402879…02787851076362431999
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
2.551 × 10¹⁰⁰(101-digit number)
25514238576634402879…02787851076362431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.102 × 10¹⁰⁰(101-digit number)
51028477153268805758…05575702152724863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.020 × 10¹⁰¹(102-digit number)
10205695430653761151…11151404305449727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.041 × 10¹⁰¹(102-digit number)
20411390861307522303…22302808610899455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.082 × 10¹⁰¹(102-digit number)
40822781722615044606…44605617221798911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.164 × 10¹⁰¹(102-digit number)
81645563445230089213…89211234443597823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.632 × 10¹⁰²(103-digit number)
16329112689046017842…78422468887195647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.265 × 10¹⁰²(103-digit number)
32658225378092035685…56844937774391295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.531 × 10¹⁰²(103-digit number)
65316450756184071370…13689875548782591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.306 × 10¹⁰³(104-digit number)
13063290151236814274…27379751097565183999
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,741,298 XPM·at block #6,812,159 · 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