Block #844,654

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 6:46:07 AM · Difficulty 10.9730 · 5,968,348 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4361cf9b201483e5fb26ebf24adb3610091f77045b79785d77e8acbe2be6d8ff

Height

#844,654

Difficulty

10.972951

Transactions

9

Size

5.57 KB

Version

2

Bits

0af91351

Nonce

983,928,963

Timestamp

12/8/2014, 6:46:07 AM

Confirmations

5,968,348

Merkle Root

1c933cf7533d0db299da793f3c9b26da07c0ff4e15dfd2c1085a09530b44f257
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.057 × 10⁹⁵(96-digit number)
10579140517685341280…25521891283801588401
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.057 × 10⁹⁵(96-digit number)
10579140517685341280…25521891283801588401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.115 × 10⁹⁵(96-digit number)
21158281035370682560…51043782567603176801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.231 × 10⁹⁵(96-digit number)
42316562070741365120…02087565135206353601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.463 × 10⁹⁵(96-digit number)
84633124141482730240…04175130270412707201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.692 × 10⁹⁶(97-digit number)
16926624828296546048…08350260540825414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.385 × 10⁹⁶(97-digit number)
33853249656593092096…16700521081650828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.770 × 10⁹⁶(97-digit number)
67706499313186184192…33401042163301657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.354 × 10⁹⁷(98-digit number)
13541299862637236838…66802084326603315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.708 × 10⁹⁷(98-digit number)
27082599725274473676…33604168653206630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.416 × 10⁹⁷(98-digit number)
54165199450548947353…67208337306413260801
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,748,056 XPM·at block #6,813,001 · 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