Block #340,636

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 10:11:05 PM · Difficulty 10.1336 · 6,474,500 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c64210a6852ca155ff6813385d9c22f4b1b852ffe27a65fb02b372433d841e13

Height

#340,636

Difficulty

10.133649

Transactions

7

Size

6.84 KB

Version

2

Bits

0a2236ce

Nonce

170,880

Timestamp

1/2/2014, 10:11:05 PM

Confirmations

6,474,500

Merkle Root

faa38e4efb1b5abdfbe5295f4ac1583a9c60cebc3195c8649e1d154ee7bd981e
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.069 × 10¹⁰¹(102-digit number)
10696625114345601862…06021481049365107521
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.069 × 10¹⁰¹(102-digit number)
10696625114345601862…06021481049365107521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.139 × 10¹⁰¹(102-digit number)
21393250228691203725…12042962098730215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.278 × 10¹⁰¹(102-digit number)
42786500457382407450…24085924197460430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.557 × 10¹⁰¹(102-digit number)
85573000914764814900…48171848394920860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.711 × 10¹⁰²(103-digit number)
17114600182952962980…96343696789841720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.422 × 10¹⁰²(103-digit number)
34229200365905925960…92687393579683440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.845 × 10¹⁰²(103-digit number)
68458400731811851920…85374787159366881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.369 × 10¹⁰³(104-digit number)
13691680146362370384…70749574318733762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.738 × 10¹⁰³(104-digit number)
27383360292724740768…41499148637467525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.476 × 10¹⁰³(104-digit number)
54766720585449481536…82998297274935050241
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,765,181 XPM·at block #6,815,135 · 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