Block #472,461

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 7:27:30 AM · Difficulty 10.4343 · 6,335,383 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6323cfe4459d39b3b01e902050843dd237505ba719dd96bcc720b19b10ef386b

Height

#472,461

Difficulty

10.434342

Transactions

2

Size

1.31 KB

Version

2

Bits

0a6f3107

Nonce

165,506

Timestamp

4/3/2014, 7:27:30 AM

Confirmations

6,335,383

Merkle Root

e0cfebb0efa732f34d16f5a75d08a16e9b330827fca798b7a025db77dfe4dac6
Transactions (2)
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.697 × 10¹⁰¹(102-digit number)
16975472022718476026…68081251790630951999
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.697 × 10¹⁰¹(102-digit number)
16975472022718476026…68081251790630951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.395 × 10¹⁰¹(102-digit number)
33950944045436952052…36162503581261903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.790 × 10¹⁰¹(102-digit number)
67901888090873904105…72325007162523807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.358 × 10¹⁰²(103-digit number)
13580377618174780821…44650014325047615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.716 × 10¹⁰²(103-digit number)
27160755236349561642…89300028650095231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.432 × 10¹⁰²(103-digit number)
54321510472699123284…78600057300190463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.086 × 10¹⁰³(104-digit number)
10864302094539824656…57200114600380927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.172 × 10¹⁰³(104-digit number)
21728604189079649313…14400229200761855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.345 × 10¹⁰³(104-digit number)
43457208378159298627…28800458401523711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.691 × 10¹⁰³(104-digit number)
86914416756318597255…57600916803047423999
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,706,790 XPM·at block #6,807,843 · 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