Block #339,918

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 10:46:36 AM · Difficulty 10.1276 · 6,469,780 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b61103c8abf70a850e4675de2504854a8dd5de55c93484279cd0357c6c873fb6

Height

#339,918

Difficulty

10.127576

Transactions

12

Size

3.25 KB

Version

2

Bits

0a20a8d7

Nonce

260,152

Timestamp

1/2/2014, 10:46:36 AM

Confirmations

6,469,780

Merkle Root

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

8.441 × 10⁹⁸(99-digit number)
84413342142960522024…99332110959181562881
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
8.441 × 10⁹⁸(99-digit number)
84413342142960522024…99332110959181562881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.688 × 10⁹⁹(100-digit number)
16882668428592104404…98664221918363125761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.376 × 10⁹⁹(100-digit number)
33765336857184208809…97328443836726251521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.753 × 10⁹⁹(100-digit number)
67530673714368417619…94656887673452503041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.350 × 10¹⁰⁰(101-digit number)
13506134742873683523…89313775346905006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.701 × 10¹⁰⁰(101-digit number)
27012269485747367047…78627550693810012161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.402 × 10¹⁰⁰(101-digit number)
54024538971494734095…57255101387620024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.080 × 10¹⁰¹(102-digit number)
10804907794298946819…14510202775240048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.160 × 10¹⁰¹(102-digit number)
21609815588597893638…29020405550480097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.321 × 10¹⁰¹(102-digit number)
43219631177195787276…58040811100960194561
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,661 XPM·at block #6,809,697 · 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