Block #833,314

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2014, 3:43:34 PM · Difficulty 10.9779 · 5,975,552 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
15aef490c1972e5f645f8648b09d6b44c0afe736ada87c1a3bdd00066ba10ac6

Height

#833,314

Difficulty

10.977871

Transactions

5

Size

1.08 KB

Version

2

Bits

0afa55c4

Nonce

1,237,376,327

Timestamp

11/29/2014, 3:43:34 PM

Confirmations

5,975,552

Merkle Root

5bb089a073b02cdffa596effef4d6d9dc2bc3f3688b6b49dc6c33e37b820ba1e
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.397 × 10⁹⁴(95-digit number)
13979112747815334064…12909305089483882241
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.397 × 10⁹⁴(95-digit number)
13979112747815334064…12909305089483882241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.795 × 10⁹⁴(95-digit number)
27958225495630668128…25818610178967764481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.591 × 10⁹⁴(95-digit number)
55916450991261336257…51637220357935528961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.118 × 10⁹⁵(96-digit number)
11183290198252267251…03274440715871057921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.236 × 10⁹⁵(96-digit number)
22366580396504534502…06548881431742115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.473 × 10⁹⁵(96-digit number)
44733160793009069005…13097762863484231681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.946 × 10⁹⁵(96-digit number)
89466321586018138011…26195525726968463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.789 × 10⁹⁶(97-digit number)
17893264317203627602…52391051453936926721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.578 × 10⁹⁶(97-digit number)
35786528634407255204…04782102907873853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.157 × 10⁹⁶(97-digit number)
71573057268814510409…09564205815747706881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.431 × 10⁹⁷(98-digit number)
14314611453762902081…19128411631495413761
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,714,977 XPM·at block #6,808,865 · 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