Block #830,993

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2014, 8:44:34 PM · Difficulty 10.9789 · 5,995,716 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
30d6b548ba9ae49c4bbb3664041a01b740d1581879be58a066409efde7d80bb7

Height

#830,993

Difficulty

10.978914

Transactions

9

Size

2.69 KB

Version

2

Bits

0afa9a16

Nonce

364,027,041

Timestamp

11/27/2014, 8:44:34 PM

Confirmations

5,995,716

Merkle Root

391d5ccfac941015ed429a2b3634aa7126165cd481eefd4a9077b5431923f2e8
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.869 × 10⁹⁶(97-digit number)
38690914955687950927…41513752883827220481
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.869 × 10⁹⁶(97-digit number)
38690914955687950927…41513752883827220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.738 × 10⁹⁶(97-digit number)
77381829911375901855…83027505767654440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.547 × 10⁹⁷(98-digit number)
15476365982275180371…66055011535308881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.095 × 10⁹⁷(98-digit number)
30952731964550360742…32110023070617763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.190 × 10⁹⁷(98-digit number)
61905463929100721484…64220046141235527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.238 × 10⁹⁸(99-digit number)
12381092785820144296…28440092282471055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.476 × 10⁹⁸(99-digit number)
24762185571640288593…56880184564942110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.952 × 10⁹⁸(99-digit number)
49524371143280577187…13760369129884221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.904 × 10⁹⁸(99-digit number)
99048742286561154374…27520738259768442881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.980 × 10⁹⁹(100-digit number)
19809748457312230874…55041476519536885761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.961 × 10⁹⁹(100-digit number)
39619496914624461749…10082953039073771521
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,857,824 XPM·at block #6,826,708 · 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