Block #838,827

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2014, 11:00:29 PM · Difficulty 10.9748 · 5,973,507 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24b421737a149f450b1c2fb4ce87eab72a0124f6f10b24a191a65b946bf8c300

Height

#838,827

Difficulty

10.974835

Transactions

4

Size

1.12 KB

Version

2

Bits

0af98ec1

Nonce

18,126,206

Timestamp

12/3/2014, 11:00:29 PM

Confirmations

5,973,507

Merkle Root

50a45f49aa33946e58c873ed5fa5d0064b79e2e3aeaf58f82161ef1e32699059
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.

5.693 × 10⁹⁵(96-digit number)
56934929051096600697…54105451807832327841
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
5.693 × 10⁹⁵(96-digit number)
56934929051096600697…54105451807832327841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.138 × 10⁹⁶(97-digit number)
11386985810219320139…08210903615664655681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.277 × 10⁹⁶(97-digit number)
22773971620438640278…16421807231329311361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.554 × 10⁹⁶(97-digit number)
45547943240877280557…32843614462658622721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.109 × 10⁹⁶(97-digit number)
91095886481754561115…65687228925317245441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.821 × 10⁹⁷(98-digit number)
18219177296350912223…31374457850634490881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.643 × 10⁹⁷(98-digit number)
36438354592701824446…62748915701268981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.287 × 10⁹⁷(98-digit number)
72876709185403648892…25497831402537963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.457 × 10⁹⁸(99-digit number)
14575341837080729778…50995662805075927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.915 × 10⁹⁸(99-digit number)
29150683674161459557…01991325610151854081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.830 × 10⁹⁸(99-digit number)
58301367348322919114…03982651220303708161
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,742,690 XPM·at block #6,812,333 · 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