Block #340,292

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 4:40:11 PM · Difficulty 10.1313 · 6,467,749 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecd0982c7bfa668be2c7b37a1ce3943d599c326334dad00176ccf10570df85f8

Height

#340,292

Difficulty

10.131251

Transactions

5

Size

1.23 KB

Version

2

Bits

0a2199ab

Nonce

102,512

Timestamp

1/2/2014, 4:40:11 PM

Confirmations

6,467,749

Merkle Root

e22482fafce083699b77f52c1f33e0a2a36432856b62a447209cc88554d73601
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.

6.279 × 10¹⁰¹(102-digit number)
62797254006774293290…49780212790714014721
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
6.279 × 10¹⁰¹(102-digit number)
62797254006774293290…49780212790714014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.255 × 10¹⁰²(103-digit number)
12559450801354858658…99560425581428029441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.511 × 10¹⁰²(103-digit number)
25118901602709717316…99120851162856058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.023 × 10¹⁰²(103-digit number)
50237803205419434632…98241702325712117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.004 × 10¹⁰³(104-digit number)
10047560641083886926…96483404651424235521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.009 × 10¹⁰³(104-digit number)
20095121282167773853…92966809302848471041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.019 × 10¹⁰³(104-digit number)
40190242564335547706…85933618605696942081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.038 × 10¹⁰³(104-digit number)
80380485128671095412…71867237211393884161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.607 × 10¹⁰⁴(105-digit number)
16076097025734219082…43734474422787768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.215 × 10¹⁰⁴(105-digit number)
32152194051468438164…87468948845575536641
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,708,372 XPM·at block #6,808,040 · 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