Block #311,779

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 5:33:51 PM · Difficulty 9.9956 · 6,498,278 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b69ed6b945b0e7863ea9e1744a313aae0d4279766c22870457fdfc476ce3c481

Height

#311,779

Difficulty

9.995592

Transactions

22

Size

122.49 KB

Version

2

Bits

09fedf24

Nonce

5,631

Timestamp

12/14/2013, 5:33:51 PM

Confirmations

6,498,278

Merkle Root

f6f8db4db70f95998f24a29a380ed130b2cba010bad525f0303b718db136858c
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.422 × 10⁹⁷(98-digit number)
74220950712366374015…34750163304664547839
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.422 × 10⁹⁷(98-digit number)
74220950712366374015…34750163304664547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.484 × 10⁹⁸(99-digit number)
14844190142473274803…69500326609329095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.968 × 10⁹⁸(99-digit number)
29688380284946549606…39000653218658191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.937 × 10⁹⁸(99-digit number)
59376760569893099212…78001306437316382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.187 × 10⁹⁹(100-digit number)
11875352113978619842…56002612874632765439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.375 × 10⁹⁹(100-digit number)
23750704227957239684…12005225749265530879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.750 × 10⁹⁹(100-digit number)
47501408455914479369…24010451498531061759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.500 × 10⁹⁹(100-digit number)
95002816911828958739…48020902997062123519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.900 × 10¹⁰⁰(101-digit number)
19000563382365791747…96041805994124247039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.800 × 10¹⁰⁰(101-digit number)
38001126764731583495…92083611988248494079
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,724,529 XPM·at block #6,810,056 · 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