Block #1,537,967

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2016, 1:21:36 PM · Difficulty 10.6327 · 5,289,189 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e9e63bfb5cad2f3845e7f2d200cbed4d899d4c5421f4ee6ff47df018944434d9

Height

#1,537,967

Difficulty

10.632733

Transactions

2

Size

1.42 KB

Version

2

Bits

0aa1fac4

Nonce

344,767,312

Timestamp

4/12/2016, 1:21:36 PM

Confirmations

5,289,189

Merkle Root

39941c67b019111a6dbe6716eb9c07f32ac35d08f25124df562683d0411930d2
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.583 × 10⁹⁵(96-digit number)
35834790949106949383…41585520295005422719
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.583 × 10⁹⁵(96-digit number)
35834790949106949383…41585520295005422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.166 × 10⁹⁵(96-digit number)
71669581898213898766…83171040590010845439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.433 × 10⁹⁶(97-digit number)
14333916379642779753…66342081180021690879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.866 × 10⁹⁶(97-digit number)
28667832759285559506…32684162360043381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.733 × 10⁹⁶(97-digit number)
57335665518571119013…65368324720086763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.146 × 10⁹⁷(98-digit number)
11467133103714223802…30736649440173527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.293 × 10⁹⁷(98-digit number)
22934266207428447605…61473298880347054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.586 × 10⁹⁷(98-digit number)
45868532414856895210…22946597760694108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.173 × 10⁹⁷(98-digit number)
91737064829713790421…45893195521388216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.834 × 10⁹⁸(99-digit number)
18347412965942758084…91786391042776432639
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,861,432 XPM·at block #6,827,155 · 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