Block #1,594,009

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/21/2016, 1:05:40 PM · Difficulty 10.6278 · 5,222,126 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bbcb8c7d22b7b07b54f228c6993d8a03fea799338c47e83833b7298ec0539f18

Height

#1,594,009

Difficulty

10.627815

Transactions

2

Size

802 B

Version

2

Bits

0aa0b879

Nonce

755,391,275

Timestamp

5/21/2016, 1:05:40 PM

Confirmations

5,222,126

Merkle Root

50d43c30e8fe90120f5be6f6bf71811d61456d764aaf2e90ecbfacb5b3498e5d
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.

6.067 × 10⁹⁵(96-digit number)
60675187858431960409…63869182539358924799
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
6.067 × 10⁹⁵(96-digit number)
60675187858431960409…63869182539358924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.213 × 10⁹⁶(97-digit number)
12135037571686392081…27738365078717849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.427 × 10⁹⁶(97-digit number)
24270075143372784163…55476730157435699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.854 × 10⁹⁶(97-digit number)
48540150286745568327…10953460314871398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.708 × 10⁹⁶(97-digit number)
97080300573491136654…21906920629742796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.941 × 10⁹⁷(98-digit number)
19416060114698227330…43813841259485593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.883 × 10⁹⁷(98-digit number)
38832120229396454661…87627682518971187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.766 × 10⁹⁷(98-digit number)
77664240458792909323…75255365037942374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.553 × 10⁹⁸(99-digit number)
15532848091758581864…50510730075884748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.106 × 10⁹⁸(99-digit number)
31065696183517163729…01021460151769497599
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,773,206 XPM·at block #6,816,134 · 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