Block #346,211

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 10:20:38 AM · Difficulty 10.2204 · 6,463,656 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e13a42834885126761bc94ea0d746da0612c6427e1228f32008880f1cf18690

Height

#346,211

Difficulty

10.220412

Transactions

8

Size

2.31 KB

Version

2

Bits

0a386cef

Nonce

128,212

Timestamp

1/6/2014, 10:20:38 AM

Confirmations

6,463,656

Merkle Root

6ea35d90b17836b6f5c3178dc957c12efc21dc0f9ee507ac3f9247c9263f2456
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.

5.169 × 10⁹⁴(95-digit number)
51691638309658123424…35945622860346554681
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
5.169 × 10⁹⁴(95-digit number)
51691638309658123424…35945622860346554681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.033 × 10⁹⁵(96-digit number)
10338327661931624684…71891245720693109361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.067 × 10⁹⁵(96-digit number)
20676655323863249369…43782491441386218721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.135 × 10⁹⁵(96-digit number)
41353310647726498739…87564982882772437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.270 × 10⁹⁵(96-digit number)
82706621295452997479…75129965765544874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.654 × 10⁹⁶(97-digit number)
16541324259090599495…50259931531089749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.308 × 10⁹⁶(97-digit number)
33082648518181198991…00519863062179499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.616 × 10⁹⁶(97-digit number)
66165297036362397983…01039726124358999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.323 × 10⁹⁷(98-digit number)
13233059407272479596…02079452248717998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.646 × 10⁹⁷(98-digit number)
26466118814544959193…04158904497435996161
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,723,025 XPM·at block #6,809,866 · 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