Block #318,716

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 1:32:09 PM · Difficulty 10.1600 · 6,506,994 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
141553b15c227233b0e8576db4ed85b5e6ac4062226d3df866e01e898e047b52

Height

#318,716

Difficulty

10.159961

Transactions

2

Size

1.27 KB

Version

2

Bits

0a28f330

Nonce

137,295

Timestamp

12/18/2013, 1:32:09 PM

Confirmations

6,506,994

Merkle Root

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

2.674 × 10⁹⁶(97-digit number)
26747272666012013063…79043134109575654399
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
2.674 × 10⁹⁶(97-digit number)
26747272666012013063…79043134109575654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.349 × 10⁹⁶(97-digit number)
53494545332024026126…58086268219151308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.069 × 10⁹⁷(98-digit number)
10698909066404805225…16172536438302617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.139 × 10⁹⁷(98-digit number)
21397818132809610450…32345072876605235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.279 × 10⁹⁷(98-digit number)
42795636265619220901…64690145753210470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.559 × 10⁹⁷(98-digit number)
85591272531238441802…29380291506420940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.711 × 10⁹⁸(99-digit number)
17118254506247688360…58760583012841881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.423 × 10⁹⁸(99-digit number)
34236509012495376720…17521166025683763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.847 × 10⁹⁸(99-digit number)
68473018024990753441…35042332051367526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.369 × 10⁹⁹(100-digit number)
13694603604998150688…70084664102735052799
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,849,784 XPM·at block #6,825,709 · 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