Block #842,861

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 11:18:04 PM · Difficulty 10.9734 · 6,001,912 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
049834ff1461a3a3e56df1d8cbce90f3af4cb39220b20ce99077beea585f1cfb

Height

#842,861

Difficulty

10.973404

Transactions

7

Size

1.81 KB

Version

2

Bits

0af93103

Nonce

1,183,399,889

Timestamp

12/6/2014, 11:18:04 PM

Confirmations

6,001,912

Merkle Root

617078d0bb0ea78c4a7a425033f899bc53a3fbe49170e34afb8287be4c73d4a6
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.464 × 10⁹⁴(95-digit number)
24642578973618013191…24726466251659699201
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.464 × 10⁹⁴(95-digit number)
24642578973618013191…24726466251659699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.928 × 10⁹⁴(95-digit number)
49285157947236026382…49452932503319398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.857 × 10⁹⁴(95-digit number)
98570315894472052764…98905865006638796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.971 × 10⁹⁵(96-digit number)
19714063178894410552…97811730013277593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.942 × 10⁹⁵(96-digit number)
39428126357788821105…95623460026555187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.885 × 10⁹⁵(96-digit number)
78856252715577642211…91246920053110374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.577 × 10⁹⁶(97-digit number)
15771250543115528442…82493840106220748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.154 × 10⁹⁶(97-digit number)
31542501086231056884…64987680212441497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.308 × 10⁹⁶(97-digit number)
63085002172462113769…29975360424882995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.261 × 10⁹⁷(98-digit number)
12617000434492422753…59950720849765990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.523 × 10⁹⁷(98-digit number)
25234000868984845507…19901441699531980801
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:58,002,597 XPM·at block #6,844,772 · 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