Block #1,609,528

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2016, 11:57:08 AM · Difficulty 10.6094 · 5,221,807 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
104d50643c32fcf727c144d9992193587a6e1e858901682cbe6dc323e81e3eb3

Height

#1,609,528

Difficulty

10.609449

Transactions

3

Size

1.13 KB

Version

2

Bits

0a9c04d9

Nonce

970,481,344

Timestamp

6/1/2016, 11:57:08 AM

Confirmations

5,221,807

Merkle Root

10b086ef56abc99d07e95d731ab2cc0b53d7a4a7ff38cbfe76e42f7583312824
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.595 × 10⁹⁵(96-digit number)
35950648968887662764…09536305210849301119
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.595 × 10⁹⁵(96-digit number)
35950648968887662764…09536305210849301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.190 × 10⁹⁵(96-digit number)
71901297937775325529…19072610421698602239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.438 × 10⁹⁶(97-digit number)
14380259587555065105…38145220843397204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.876 × 10⁹⁶(97-digit number)
28760519175110130211…76290441686794408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.752 × 10⁹⁶(97-digit number)
57521038350220260423…52580883373588817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.150 × 10⁹⁷(98-digit number)
11504207670044052084…05161766747177635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.300 × 10⁹⁷(98-digit number)
23008415340088104169…10323533494355271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.601 × 10⁹⁷(98-digit number)
46016830680176208339…20647066988710543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.203 × 10⁹⁷(98-digit number)
92033661360352416678…41294133977421086719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.840 × 10⁹⁸(99-digit number)
18406732272070483335…82588267954842173439
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,894,833 XPM·at block #6,831,334 · 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