Block #478,337

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 12:39:30 AM · Difficulty 10.4925 · 6,332,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
101b9b2602cf28cce3f09bf79271251c0d60fbdaed2ec76edbee538526d93b13

Height

#478,337

Difficulty

10.492498

Transactions

3

Size

659 B

Version

2

Bits

0a7e1457

Nonce

11,208

Timestamp

4/7/2014, 12:39:30 AM

Confirmations

6,332,025

Merkle Root

1dc7dcee4b41e5607dae4b8b6ee6483c628ee92c5c194550e673165e26e6551d
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.061 × 10⁹⁹(100-digit number)
10612432550695931826…23277316278811069439
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.061 × 10⁹⁹(100-digit number)
10612432550695931826…23277316278811069439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.122 × 10⁹⁹(100-digit number)
21224865101391863652…46554632557622138879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.244 × 10⁹⁹(100-digit number)
42449730202783727305…93109265115244277759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.489 × 10⁹⁹(100-digit number)
84899460405567454611…86218530230488555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.697 × 10¹⁰⁰(101-digit number)
16979892081113490922…72437060460977111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.395 × 10¹⁰⁰(101-digit number)
33959784162226981844…44874120921954222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.791 × 10¹⁰⁰(101-digit number)
67919568324453963689…89748241843908444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.358 × 10¹⁰¹(102-digit number)
13583913664890792737…79496483687816888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.716 × 10¹⁰¹(102-digit number)
27167827329781585475…58992967375633776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.433 × 10¹⁰¹(102-digit number)
54335654659563170951…17985934751267553279
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,726,971 XPM·at block #6,810,361 · 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