Block #2,858,862

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/28/2018, 8:08:15 PM · Difficulty 11.6795 · 3,983,843 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ac7cede6cd30feafc9f23cba17c03e19744092c2339d32ad4f405f3975533898

Height

#2,858,862

Difficulty

11.679495

Transactions

9

Size

5.17 KB

Version

2

Bits

0badf363

Nonce

482,489,159

Timestamp

9/28/2018, 8:08:15 PM

Confirmations

3,983,843

Merkle Root

a35d27555ab6d8a50e6e5e2a142932d4053b6627e0f8a7cb4634827ef1463fe7
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.

4.823 × 10⁹³(94-digit number)
48238180316176437253…89686847622960080151
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
4.823 × 10⁹³(94-digit number)
48238180316176437253…89686847622960080151
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.647 × 10⁹³(94-digit number)
96476360632352874507…79373695245920160301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.929 × 10⁹⁴(95-digit number)
19295272126470574901…58747390491840320601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.859 × 10⁹⁴(95-digit number)
38590544252941149802…17494780983680641201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.718 × 10⁹⁴(95-digit number)
77181088505882299605…34989561967361282401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.543 × 10⁹⁵(96-digit number)
15436217701176459921…69979123934722564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.087 × 10⁹⁵(96-digit number)
30872435402352919842…39958247869445129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.174 × 10⁹⁵(96-digit number)
61744870804705839684…79916495738890259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.234 × 10⁹⁶(97-digit number)
12348974160941167936…59832991477780518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.469 × 10⁹⁶(97-digit number)
24697948321882335873…19665982955561036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.939 × 10⁹⁶(97-digit number)
49395896643764671747…39331965911122073601
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,985,989 XPM·at block #6,842,704 · 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