Block #852,188

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 9:33:54 PM · Difficulty 10.9701 · 5,990,055 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5f790cd52059ea3c212a7d8a4bdab9b5f37d997e5e235e272e4f64b1fa7aa90b

Height

#852,188

Difficulty

10.970081

Transactions

2

Size

467 B

Version

2

Bits

0af8573b

Nonce

2,033,647,602

Timestamp

12/13/2014, 9:33:54 PM

Confirmations

5,990,055

Merkle Root

9b69ae92fff914513e61b1f1020195b270149a5442430df4555a03015c95b266
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.091 × 10⁹⁶(97-digit number)
30911693739100986052…47000395649640980481
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.091 × 10⁹⁶(97-digit number)
30911693739100986052…47000395649640980481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.182 × 10⁹⁶(97-digit number)
61823387478201972105…94000791299281960961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.236 × 10⁹⁷(98-digit number)
12364677495640394421…88001582598563921921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.472 × 10⁹⁷(98-digit number)
24729354991280788842…76003165197127843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.945 × 10⁹⁷(98-digit number)
49458709982561577684…52006330394255687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.891 × 10⁹⁷(98-digit number)
98917419965123155369…04012660788511375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.978 × 10⁹⁸(99-digit number)
19783483993024631073…08025321577022750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.956 × 10⁹⁸(99-digit number)
39566967986049262147…16050643154045501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.913 × 10⁹⁸(99-digit number)
79133935972098524295…32101286308091002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.582 × 10⁹⁹(100-digit number)
15826787194419704859…64202572616182005761
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,982,342 XPM·at block #6,842,242 · 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