Block #1,395,026

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2016, 8:34:02 PM · Difficulty 10.8130 · 5,431,549 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
deedf283a14e3009ba6f38e7c9ec37b905e67c1172e5cf1a56da6027304bf827

Height

#1,395,026

Difficulty

10.812986

Transactions

4

Size

5.74 KB

Version

2

Bits

0ad01fd7

Nonce

606,205,124

Timestamp

1/1/2016, 8:34:02 PM

Confirmations

5,431,549

Merkle Root

050dbb0b0ac6940369632dd67df28821e9ac01a429c31ec7a0b047c17aab0e3d
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.

4.689 × 10⁹³(94-digit number)
46892262502711188060…31440949741196244479
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
4.689 × 10⁹³(94-digit number)
46892262502711188060…31440949741196244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.378 × 10⁹³(94-digit number)
93784525005422376121…62881899482392488959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.875 × 10⁹⁴(95-digit number)
18756905001084475224…25763798964784977919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.751 × 10⁹⁴(95-digit number)
37513810002168950448…51527597929569955839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.502 × 10⁹⁴(95-digit number)
75027620004337900897…03055195859139911679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.500 × 10⁹⁵(96-digit number)
15005524000867580179…06110391718279823359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.001 × 10⁹⁵(96-digit number)
30011048001735160358…12220783436559646719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.002 × 10⁹⁵(96-digit number)
60022096003470320717…24441566873119293439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.200 × 10⁹⁶(97-digit number)
12004419200694064143…48883133746238586879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.400 × 10⁹⁶(97-digit number)
24008838401388128287…97766267492477173759
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,856,749 XPM·at block #6,826,574 · 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