Block #318,909

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 4:38:21 PM · Difficulty 10.1615 · 6,497,146 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
97c1b653fef8060dcc127387eb66cce1eda595e596e773b7533f0b3f67ec6052

Height

#318,909

Difficulty

10.161467

Transactions

8

Size

7.57 KB

Version

2

Bits

0a2955ef

Nonce

8,867

Timestamp

12/18/2013, 4:38:21 PM

Confirmations

6,497,146

Merkle Root

cc7d615d9ca112895d8642becaabf4b3f5d6df64755122f99dfe849bf82b4a12
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.038 × 10⁹⁵(96-digit number)
30385095875326499871…30197504530504825519
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.038 × 10⁹⁵(96-digit number)
30385095875326499871…30197504530504825519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.077 × 10⁹⁵(96-digit number)
60770191750652999743…60395009061009651039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.215 × 10⁹⁶(97-digit number)
12154038350130599948…20790018122019302079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.430 × 10⁹⁶(97-digit number)
24308076700261199897…41580036244038604159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.861 × 10⁹⁶(97-digit number)
48616153400522399795…83160072488077208319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.723 × 10⁹⁶(97-digit number)
97232306801044799590…66320144976154416639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.944 × 10⁹⁷(98-digit number)
19446461360208959918…32640289952308833279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.889 × 10⁹⁷(98-digit number)
38892922720417919836…65280579904617666559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.778 × 10⁹⁷(98-digit number)
77785845440835839672…30561159809235333119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.555 × 10⁹⁸(99-digit number)
15557169088167167934…61122319618470666239
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,772,555 XPM·at block #6,816,054 · 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