Block #1,603,695

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2016, 1:10:12 PM · Difficulty 10.5979 · 5,214,193 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51c7903333b2ca3c6b2289b3b24a51aefe91dff260e3c0c48ad64ed89ef9e0b7

Height

#1,603,695

Difficulty

10.597851

Transactions

2

Size

1.31 KB

Version

2

Bits

0a990cc1

Nonce

667,521,387

Timestamp

5/28/2016, 1:10:12 PM

Confirmations

5,214,193

Merkle Root

b7f2ab6ccc81c02a15810cd1f93fca96bc00376bb548a0d0bdb480d62ba34cc1
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.

1.417 × 10⁹⁴(95-digit number)
14177725821046178988…78448472873814892679
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
1.417 × 10⁹⁴(95-digit number)
14177725821046178988…78448472873814892679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.835 × 10⁹⁴(95-digit number)
28355451642092357977…56896945747629785359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.671 × 10⁹⁴(95-digit number)
56710903284184715955…13793891495259570719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.134 × 10⁹⁵(96-digit number)
11342180656836943191…27587782990519141439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.268 × 10⁹⁵(96-digit number)
22684361313673886382…55175565981038282879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.536 × 10⁹⁵(96-digit number)
45368722627347772764…10351131962076565759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.073 × 10⁹⁵(96-digit number)
90737445254695545529…20702263924153131519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.814 × 10⁹⁶(97-digit number)
18147489050939109105…41404527848306263039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.629 × 10⁹⁶(97-digit number)
36294978101878218211…82809055696612526079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.258 × 10⁹⁶(97-digit number)
72589956203756436423…65618111393225052159
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,787,164 XPM·at block #6,817,887 · 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