Block #312,943

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2013, 6:11:05 AM · Difficulty 9.9960 · 6,514,289 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4075fb18019b08e076535e495fb1f40ea329976b7ae33236faf4a44fe3403262

Height

#312,943

Difficulty

9.995969

Transactions

2

Size

1.14 KB

Version

2

Bits

09fef7d6

Nonce

46,576

Timestamp

12/15/2013, 6:11:05 AM

Confirmations

6,514,289

Merkle Root

3882611f8549d83f0be8168d506c0e4e4e29b20ce8527dccced6163bfde32f9a
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.698 × 10⁹⁶(97-digit number)
36989717585208512400…77020959044658421579
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.698 × 10⁹⁶(97-digit number)
36989717585208512400…77020959044658421579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.397 × 10⁹⁶(97-digit number)
73979435170417024801…54041918089316843159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.479 × 10⁹⁷(98-digit number)
14795887034083404960…08083836178633686319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.959 × 10⁹⁷(98-digit number)
29591774068166809920…16167672357267372639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.918 × 10⁹⁷(98-digit number)
59183548136333619840…32335344714534745279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.183 × 10⁹⁸(99-digit number)
11836709627266723968…64670689429069490559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.367 × 10⁹⁸(99-digit number)
23673419254533447936…29341378858138981119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.734 × 10⁹⁸(99-digit number)
47346838509066895872…58682757716277962239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.469 × 10⁹⁸(99-digit number)
94693677018133791745…17365515432555924479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.893 × 10⁹⁹(100-digit number)
18938735403626758349…34731030865111848959
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,861,956 XPM·at block #6,827,231 · 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