Block #298,914

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 3:13:32 PM · Difficulty 9.9920 · 6,515,996 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5abc7820b303c2678aeb817faed8e2691c9e34534fae61ab69bc253496e79e7e

Height

#298,914

Difficulty

9.992038

Transactions

1

Size

1.15 KB

Version

2

Bits

09fdf63a

Nonce

14,273

Timestamp

12/7/2013, 3:13:32 PM

Confirmations

6,515,996

Merkle Root

beaea5bc8b885c030911522f9ebc9132152fa4d2ab0a46badd0eaaa144941237
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.240 × 10⁹⁴(95-digit number)
32401300525126741578…41246710136430308481
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.240 × 10⁹⁴(95-digit number)
32401300525126741578…41246710136430308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.480 × 10⁹⁴(95-digit number)
64802601050253483156…82493420272860616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.296 × 10⁹⁵(96-digit number)
12960520210050696631…64986840545721233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.592 × 10⁹⁵(96-digit number)
25921040420101393262…29973681091442467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.184 × 10⁹⁵(96-digit number)
51842080840202786525…59947362182884935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.036 × 10⁹⁶(97-digit number)
10368416168040557305…19894724365769871361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.073 × 10⁹⁶(97-digit number)
20736832336081114610…39789448731539742721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.147 × 10⁹⁶(97-digit number)
41473664672162229220…79578897463079485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.294 × 10⁹⁶(97-digit number)
82947329344324458440…59157794926158970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.658 × 10⁹⁷(98-digit number)
16589465868864891688…18315589852317941761
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,763,371 XPM·at block #6,814,909 · 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