Block #338,681

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 2:33:15 PM · Difficulty 10.1227 · 6,471,455 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b10309e2626859da52b7236145aaa0d7ab574196249065822c43dd9873237ed

Height

#338,681

Difficulty

10.122659

Transactions

6

Size

2.28 KB

Version

2

Bits

0a1f668e

Nonce

8,133

Timestamp

1/1/2014, 2:33:15 PM

Confirmations

6,471,455

Merkle Root

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

3.100 × 10¹⁰⁴(105-digit number)
31002543288988417001…00205654966577378561
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
3.100 × 10¹⁰⁴(105-digit number)
31002543288988417001…00205654966577378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.200 × 10¹⁰⁴(105-digit number)
62005086577976834002…00411309933154757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.240 × 10¹⁰⁵(106-digit number)
12401017315595366800…00822619866309514241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.480 × 10¹⁰⁵(106-digit number)
24802034631190733601…01645239732619028481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.960 × 10¹⁰⁵(106-digit number)
49604069262381467202…03290479465238056961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.920 × 10¹⁰⁵(106-digit number)
99208138524762934404…06580958930476113921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.984 × 10¹⁰⁶(107-digit number)
19841627704952586880…13161917860952227841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.968 × 10¹⁰⁶(107-digit number)
39683255409905173761…26323835721904455681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.936 × 10¹⁰⁶(107-digit number)
79366510819810347523…52647671443808911361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.587 × 10¹⁰⁷(108-digit number)
15873302163962069504…05295342887617822721
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,725,155 XPM·at block #6,810,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.

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