Block #299,659

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 2:54:58 AM · Difficulty 9.9921 · 6,525,103 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
336b7b1e5a35fa142b0cc001105feecbf1d862180e9116c0d69fbd20e49ef486

Height

#299,659

Difficulty

9.992132

Transactions

17

Size

5.68 KB

Version

2

Bits

09fdfc57

Nonce

2,434

Timestamp

12/8/2013, 2:54:58 AM

Confirmations

6,525,103

Merkle Root

39a631738f97d18598539aa65f032e82d01aba6272cd3c4f017843e3e34585c0
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.

4.460 × 10⁹⁴(95-digit number)
44607254142308048446…44554693893274375361
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
4.460 × 10⁹⁴(95-digit number)
44607254142308048446…44554693893274375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.921 × 10⁹⁴(95-digit number)
89214508284616096892…89109387786548750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.784 × 10⁹⁵(96-digit number)
17842901656923219378…78218775573097501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.568 × 10⁹⁵(96-digit number)
35685803313846438757…56437551146195002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.137 × 10⁹⁵(96-digit number)
71371606627692877514…12875102292390005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.427 × 10⁹⁶(97-digit number)
14274321325538575502…25750204584780011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.854 × 10⁹⁶(97-digit number)
28548642651077151005…51500409169560023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.709 × 10⁹⁶(97-digit number)
57097285302154302011…03000818339120046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.141 × 10⁹⁷(98-digit number)
11419457060430860402…06001636678240092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.283 × 10⁹⁷(98-digit number)
22838914120861720804…12003273356480184321
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,842,168 XPM·at block #6,824,761 · 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