Block #333,287

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2013, 4:24:03 PM · Difficulty 10.1641 · 6,493,279 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b2fb7f38e9d89d71e201c4bf0155310c41490196a7b686eb6aeb928405b3adce

Height

#333,287

Difficulty

10.164091

Transactions

16

Size

5.41 KB

Version

2

Bits

0a2a01dc

Nonce

108,028

Timestamp

12/28/2013, 4:24:03 PM

Confirmations

6,493,279

Merkle Root

765ca08b74fae52d855d4e129c105e2b55a186ca26dccc1de0edcc3bfdc7ec1d
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.996 × 10¹⁰¹(102-digit number)
19963288673252743997…14139264463634076801
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.996 × 10¹⁰¹(102-digit number)
19963288673252743997…14139264463634076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.992 × 10¹⁰¹(102-digit number)
39926577346505487994…28278528927268153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.985 × 10¹⁰¹(102-digit number)
79853154693010975989…56557057854536307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.597 × 10¹⁰²(103-digit number)
15970630938602195197…13114115709072614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.194 × 10¹⁰²(103-digit number)
31941261877204390395…26228231418145228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.388 × 10¹⁰²(103-digit number)
63882523754408780791…52456462836290457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.277 × 10¹⁰³(104-digit number)
12776504750881756158…04912925672580915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.555 × 10¹⁰³(104-digit number)
25553009501763512316…09825851345161830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.110 × 10¹⁰³(104-digit number)
51106019003527024633…19651702690323660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.022 × 10¹⁰⁴(105-digit number)
10221203800705404926…39303405380647321601
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,856,680 XPM·at block #6,826,565 · 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