Block #334,864

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/29/2013, 7:14:32 PM · Difficulty 10.1595 · 6,474,668 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bdc70341503c983f27e400d983f83dd8c5db5ab65e20987f73f014ade2a17c8d

Height

#334,864

Difficulty

10.159494

Transactions

18

Size

4.79 KB

Version

2

Bits

0a28d493

Nonce

19,247

Timestamp

12/29/2013, 7:14:32 PM

Confirmations

6,474,668

Merkle Root

3a7ef5a5c2c2ae742c7b27c3f02afa3da60c03d038c9742353f25e5344b1ffe7
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.159 × 10¹⁰⁰(101-digit number)
81594653507277505281…35419014226086323201
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.159 × 10¹⁰⁰(101-digit number)
81594653507277505281…35419014226086323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.631 × 10¹⁰¹(102-digit number)
16318930701455501056…70838028452172646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.263 × 10¹⁰¹(102-digit number)
32637861402911002112…41676056904345292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.527 × 10¹⁰¹(102-digit number)
65275722805822004225…83352113808690585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.305 × 10¹⁰²(103-digit number)
13055144561164400845…66704227617381171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.611 × 10¹⁰²(103-digit number)
26110289122328801690…33408455234762342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.222 × 10¹⁰²(103-digit number)
52220578244657603380…66816910469524684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.044 × 10¹⁰³(104-digit number)
10444115648931520676…33633820939049369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.088 × 10¹⁰³(104-digit number)
20888231297863041352…67267641878098739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.177 × 10¹⁰³(104-digit number)
41776462595726082704…34535283756197478401
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,720,334 XPM·at block #6,809,531 · 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