Block #337,265

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2013, 1:25:21 PM · Difficulty 10.1381 · 6,469,102 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
16d8696654454735b9e68575619f0b97b82f8850a97db6b769a4d33b500437fd

Height

#337,265

Difficulty

10.138137

Transactions

4

Size

32.16 KB

Version

2

Bits

0a235cf0

Nonce

732

Timestamp

12/31/2013, 1:25:21 PM

Confirmations

6,469,102

Merkle Root

f6237d62e0ebd85da6dc59db1754fb27b6ec10d18976b3978e027f349a332d3f
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.163 × 10⁹⁴(95-digit number)
31637466185618589086…90138555561040690381
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.163 × 10⁹⁴(95-digit number)
31637466185618589086…90138555561040690381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.327 × 10⁹⁴(95-digit number)
63274932371237178173…80277111122081380761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.265 × 10⁹⁵(96-digit number)
12654986474247435634…60554222244162761521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.530 × 10⁹⁵(96-digit number)
25309972948494871269…21108444488325523041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.061 × 10⁹⁵(96-digit number)
50619945896989742538…42216888976651046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.012 × 10⁹⁶(97-digit number)
10123989179397948507…84433777953302092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.024 × 10⁹⁶(97-digit number)
20247978358795897015…68867555906604184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.049 × 10⁹⁶(97-digit number)
40495956717591794030…37735111813208368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.099 × 10⁹⁶(97-digit number)
80991913435183588061…75470223626416737281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.619 × 10⁹⁷(98-digit number)
16198382687036717612…50940447252833474561
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,695,024 XPM·at block #6,806,366 · 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