Block #415,893

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/23/2014, 1:19:58 AM · Difficulty 10.3991 · 6,398,124 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62057eddf9293ac98e279afe99dbf8f6a2d9f6415db3e61666016b232b73ede7

Height

#415,893

Difficulty

10.399126

Transactions

2

Size

430 B

Version

2

Bits

0a662d22

Nonce

38,063

Timestamp

2/23/2014, 1:19:58 AM

Confirmations

6,398,124

Merkle Root

efa75d4efbd3627d00153b653dbaa9fb0b9f86fde68206be86244c7f6da952b9
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.055 × 10¹⁰⁶(107-digit number)
10551712007156455716…92859969000019499519
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.055 × 10¹⁰⁶(107-digit number)
10551712007156455716…92859969000019499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.110 × 10¹⁰⁶(107-digit number)
21103424014312911432…85719938000038999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.220 × 10¹⁰⁶(107-digit number)
42206848028625822865…71439876000077998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.441 × 10¹⁰⁶(107-digit number)
84413696057251645731…42879752000155996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.688 × 10¹⁰⁷(108-digit number)
16882739211450329146…85759504000311992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.376 × 10¹⁰⁷(108-digit number)
33765478422900658292…71519008000623984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.753 × 10¹⁰⁷(108-digit number)
67530956845801316585…43038016001247969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.350 × 10¹⁰⁸(109-digit number)
13506191369160263317…86076032002495938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.701 × 10¹⁰⁸(109-digit number)
27012382738320526634…72152064004991877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.402 × 10¹⁰⁸(109-digit number)
54024765476641053268…44304128009983754239
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,756,220 XPM·at block #6,814,016 · 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.
Privacy Policy·

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