Block #475,493

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/5/2014, 6:39:24 AM · Difficulty 10.4578 · 6,332,561 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a5a5260b6a716e1680b38ef9ab6b060ccbc25163ee4fa29f8f892935f105c48

Height

#475,493

Difficulty

10.457782

Transactions

1

Size

906 B

Version

2

Bits

0a753139

Nonce

220,837

Timestamp

4/5/2014, 6:39:24 AM

Confirmations

6,332,561

Merkle Root

9a629084949a6060410eeede300c6d76a0e5e690a4f72d8e8152921f89ca321e
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.286 × 10¹⁰⁵(106-digit number)
52861290259071095074…51667962367909614199
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.286 × 10¹⁰⁵(106-digit number)
52861290259071095074…51667962367909614199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.057 × 10¹⁰⁶(107-digit number)
10572258051814219014…03335924735819228399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.114 × 10¹⁰⁶(107-digit number)
21144516103628438029…06671849471638456799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.228 × 10¹⁰⁶(107-digit number)
42289032207256876059…13343698943276913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.457 × 10¹⁰⁶(107-digit number)
84578064414513752118…26687397886553827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.691 × 10¹⁰⁷(108-digit number)
16915612882902750423…53374795773107654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.383 × 10¹⁰⁷(108-digit number)
33831225765805500847…06749591546215308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.766 × 10¹⁰⁷(108-digit number)
67662451531611001695…13499183092430617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.353 × 10¹⁰⁸(109-digit number)
13532490306322200339…26998366184861235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.706 × 10¹⁰⁸(109-digit number)
27064980612644400678…53996732369722470399
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,708,478 XPM·at block #6,808,053 · 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