Block #1,317,639

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/7/2015, 11:45:11 PM · Difficulty 10.8622 · 5,495,106 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee9b66f4b8662404ee109fd8005adfa1a5afc547f20ef3e344fe2392ff5c93a3

Height

#1,317,639

Difficulty

10.862239

Transactions

2

Size

5.04 KB

Version

2

Bits

0adcbbae

Nonce

1,779,295,870

Timestamp

11/7/2015, 11:45:11 PM

Confirmations

5,495,106

Merkle Root

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

7.371 × 10⁹⁶(97-digit number)
73710889431598356405…70314186158532024319
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
7.371 × 10⁹⁶(97-digit number)
73710889431598356405…70314186158532024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.474 × 10⁹⁷(98-digit number)
14742177886319671281…40628372317064048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.948 × 10⁹⁷(98-digit number)
29484355772639342562…81256744634128097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.896 × 10⁹⁷(98-digit number)
58968711545278685124…62513489268256194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.179 × 10⁹⁸(99-digit number)
11793742309055737024…25026978536512389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.358 × 10⁹⁸(99-digit number)
23587484618111474049…50053957073024778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.717 × 10⁹⁸(99-digit number)
47174969236222948099…00107914146049556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.434 × 10⁹⁸(99-digit number)
94349938472445896199…00215828292099112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.886 × 10⁹⁹(100-digit number)
18869987694489179239…00431656584198225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.773 × 10⁹⁹(100-digit number)
37739975388978358479…00863313168396451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.547 × 10⁹⁹(100-digit number)
75479950777956716959…01726626336792903679
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,746,003 XPM·at block #6,812,744 · 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.

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