Block #984,636

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2015, 7:43:02 PM · Difficulty 10.8475 · 5,829,457 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a3b393cc09179428a7373ac7ea59094b51e48458e9f4ae181205044ddd64dcb8

Height

#984,636

Difficulty

10.847480

Transactions

3

Size

1.22 KB

Version

2

Bits

0ad8f471

Nonce

367,780,837

Timestamp

3/21/2015, 7:43:02 PM

Confirmations

5,829,457

Merkle Root

34a86ae8c67b4d8dac61b64c859adfa59aeef08a4890b2857cd3ae07dd4d34d8
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.514 × 10⁹⁴(95-digit number)
35146270014990123931…86998009857054085119
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.514 × 10⁹⁴(95-digit number)
35146270014990123931…86998009857054085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.029 × 10⁹⁴(95-digit number)
70292540029980247862…73996019714108170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.405 × 10⁹⁵(96-digit number)
14058508005996049572…47992039428216340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.811 × 10⁹⁵(96-digit number)
28117016011992099145…95984078856432680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.623 × 10⁹⁵(96-digit number)
56234032023984198290…91968157712865361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.124 × 10⁹⁶(97-digit number)
11246806404796839658…83936315425730723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.249 × 10⁹⁶(97-digit number)
22493612809593679316…67872630851461447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.498 × 10⁹⁶(97-digit number)
44987225619187358632…35745261702922895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.997 × 10⁹⁶(97-digit number)
89974451238374717264…71490523405845790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.799 × 10⁹⁷(98-digit number)
17994890247674943452…42981046811691581439
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,756,826 XPM·at block #6,814,092 · 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