Block #1,525,500

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2016, 4:15:47 AM · Difficulty 10.6013 · 5,301,264 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72f8875520341bf8936663aeae16fc2cc664ce119e64f98e211668968e7e3965

Height

#1,525,500

Difficulty

10.601334

Transactions

2

Size

722 B

Version

2

Bits

0a99f100

Nonce

169,087,964

Timestamp

4/4/2016, 4:15:47 AM

Confirmations

5,301,264

Merkle Root

66025dd3bea0bd36fa9fff55f42ed82f5992286e7e92fe46bd8da636b0e436af
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.

3.326 × 10⁹⁶(97-digit number)
33268904528912308976…55995039827684413439
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.326 × 10⁹⁶(97-digit number)
33268904528912308976…55995039827684413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.653 × 10⁹⁶(97-digit number)
66537809057824617952…11990079655368826879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.330 × 10⁹⁷(98-digit number)
13307561811564923590…23980159310737653759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.661 × 10⁹⁷(98-digit number)
26615123623129847181…47960318621475307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.323 × 10⁹⁷(98-digit number)
53230247246259694362…95920637242950615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.064 × 10⁹⁸(99-digit number)
10646049449251938872…91841274485901230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.129 × 10⁹⁸(99-digit number)
21292098898503877744…83682548971802460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.258 × 10⁹⁸(99-digit number)
42584197797007755489…67365097943604920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.516 × 10⁹⁸(99-digit number)
85168395594015510979…34730195887209840639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.703 × 10⁹⁹(100-digit number)
17033679118803102195…69460391774419681279
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,858,272 XPM·at block #6,826,763 · 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