Block #466,475

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 5:04:05 AM · Difficulty 10.4212 · 6,342,894 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cad8eb2181cec21596afc6b57baf553615d5b5ce68af1da6d9759b18e59f23cf

Height

#466,475

Difficulty

10.421176

Transactions

8

Size

2.87 KB

Version

2

Bits

0a6bd233

Nonce

82

Timestamp

3/30/2014, 5:04:05 AM

Confirmations

6,342,894

Merkle Root

e4e8e2e1b612a6e86a5651d83fcd7d0e4b62df52624fe799c4bbcb03676f1609
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.

3.338 × 10¹⁰³(104-digit number)
33389483391075805602…14529883876512235519
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
3.338 × 10¹⁰³(104-digit number)
33389483391075805602…14529883876512235519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.677 × 10¹⁰³(104-digit number)
66778966782151611205…29059767753024471039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.335 × 10¹⁰⁴(105-digit number)
13355793356430322241…58119535506048942079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.671 × 10¹⁰⁴(105-digit number)
26711586712860644482…16239071012097884159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.342 × 10¹⁰⁴(105-digit number)
53423173425721288964…32478142024195768319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.068 × 10¹⁰⁵(106-digit number)
10684634685144257792…64956284048391536639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.136 × 10¹⁰⁵(106-digit number)
21369269370288515585…29912568096783073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.273 × 10¹⁰⁵(106-digit number)
42738538740577031171…59825136193566146559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.547 × 10¹⁰⁵(106-digit number)
85477077481154062342…19650272387132293119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.709 × 10¹⁰⁶(107-digit number)
17095415496230812468…39300544774264586239
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,719,021 XPM·at block #6,809,368 · 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