Block #311,067

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 9:17:46 AM · Difficulty 9.9954 · 6,506,297 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7b2f4a1ec121bc95d583416687814b5d183f69a01b9096dde34f249bcaaae64

Height

#311,067

Difficulty

9.995374

Transactions

1

Size

1.08 KB

Version

2

Bits

09fed0dc

Nonce

140,832

Timestamp

12/14/2013, 9:17:46 AM

Confirmations

6,506,297

Merkle Root

90f278660e728090e6f0602149727d3f28edc3d9dceecd0fb646ea6f6006060a
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.

1.718 × 10⁹⁷(98-digit number)
17184551067009078517…33410880548223215001
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
1.718 × 10⁹⁷(98-digit number)
17184551067009078517…33410880548223215001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.436 × 10⁹⁷(98-digit number)
34369102134018157035…66821761096446430001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.873 × 10⁹⁷(98-digit number)
68738204268036314071…33643522192892860001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.374 × 10⁹⁸(99-digit number)
13747640853607262814…67287044385785720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.749 × 10⁹⁸(99-digit number)
27495281707214525628…34574088771571440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.499 × 10⁹⁸(99-digit number)
54990563414429051257…69148177543142880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.099 × 10⁹⁹(100-digit number)
10998112682885810251…38296355086285760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.199 × 10⁹⁹(100-digit number)
21996225365771620502…76592710172571520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.399 × 10⁹⁹(100-digit number)
43992450731543241005…53185420345143040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.798 × 10⁹⁹(100-digit number)
87984901463086482011…06370840690286080001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,782,952 XPM·at block #6,817,363 · 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