Block #842,047

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 8:19:40 AM · Difficulty 10.9738 · 6,000,417 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
55ae3736767e362e5107048e429cc875c4edc17bab05fac274c4eba8676fb601

Height

#842,047

Difficulty

10.973817

Transactions

11

Size

2.70 KB

Version

2

Bits

0af94c13

Nonce

566,239,387

Timestamp

12/6/2014, 8:19:40 AM

Confirmations

6,000,417

Merkle Root

8b96329ddb78b1de2aebd9c10fcab7cbbfd6ce5516aba67fe1c748a49b12a5b0
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.

2.356 × 10⁹⁷(98-digit number)
23568644277709950505…33780865330263244801
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
2.356 × 10⁹⁷(98-digit number)
23568644277709950505…33780865330263244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.713 × 10⁹⁷(98-digit number)
47137288555419901011…67561730660526489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.427 × 10⁹⁷(98-digit number)
94274577110839802022…35123461321052979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.885 × 10⁹⁸(99-digit number)
18854915422167960404…70246922642105958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.770 × 10⁹⁸(99-digit number)
37709830844335920808…40493845284211916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.541 × 10⁹⁸(99-digit number)
75419661688671841617…80987690568423833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.508 × 10⁹⁹(100-digit number)
15083932337734368323…61975381136847667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.016 × 10⁹⁹(100-digit number)
30167864675468736647…23950762273695334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.033 × 10⁹⁹(100-digit number)
60335729350937473294…47901524547390668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.206 × 10¹⁰⁰(101-digit number)
12067145870187494658…95803049094781337601
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,984,130 XPM·at block #6,842,463 · 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