Block #298,173

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 4:02:16 AM · Difficulty 9.9919 · 6,511,534 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8dc0b3dcc8a9c129d9ff22ec383ed882f69d13c120c5dbc12e47d92adbd28bcd

Height

#298,173

Difficulty

9.991910

Transactions

14

Size

3.68 KB

Version

2

Bits

09fdedd0

Nonce

319,654

Timestamp

12/7/2013, 4:02:16 AM

Confirmations

6,511,534

Merkle Root

08cdc874cc89f80e18cb2c76a87c78ff1ebd3995b5bfec8fedb42d4e395fae09
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.031 × 10⁹⁶(97-digit number)
10310611898801678464…54822961849812582401
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.031 × 10⁹⁶(97-digit number)
10310611898801678464…54822961849812582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.062 × 10⁹⁶(97-digit number)
20621223797603356928…09645923699625164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.124 × 10⁹⁶(97-digit number)
41242447595206713857…19291847399250329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.248 × 10⁹⁶(97-digit number)
82484895190413427715…38583694798500659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.649 × 10⁹⁷(98-digit number)
16496979038082685543…77167389597001318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.299 × 10⁹⁷(98-digit number)
32993958076165371086…54334779194002636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.598 × 10⁹⁷(98-digit number)
65987916152330742172…08669558388005273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.319 × 10⁹⁸(99-digit number)
13197583230466148434…17339116776010547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.639 × 10⁹⁸(99-digit number)
26395166460932296869…34678233552021094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.279 × 10⁹⁸(99-digit number)
52790332921864593738…69356467104042188801
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,721,735 XPM·at block #6,809,706 · 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