Block #858,127

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 8:56:26 AM · Difficulty 10.9671 · 5,984,730 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e2165f353e2995dc50d0be296a38f7c370c2bcc6993e7fd3aff5ff03deff33e8

Height

#858,127

Difficulty

10.967099

Transactions

7

Size

1.62 KB

Version

2

Bits

0af793cf

Nonce

1,010,601,994

Timestamp

12/18/2014, 8:56:26 AM

Confirmations

5,984,730

Merkle Root

b70a6ca628822c1fb79874409e3d15efc8a2c8ce3a9673b86b4261f8dec7aa06
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.352 × 10⁹⁴(95-digit number)
13522660200031495663…82333090004955513681
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.352 × 10⁹⁴(95-digit number)
13522660200031495663…82333090004955513681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.704 × 10⁹⁴(95-digit number)
27045320400062991326…64666180009911027361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.409 × 10⁹⁴(95-digit number)
54090640800125982652…29332360019822054721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.081 × 10⁹⁵(96-digit number)
10818128160025196530…58664720039644109441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.163 × 10⁹⁵(96-digit number)
21636256320050393060…17329440079288218881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.327 × 10⁹⁵(96-digit number)
43272512640100786121…34658880158576437761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.654 × 10⁹⁵(96-digit number)
86545025280201572243…69317760317152875521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.730 × 10⁹⁶(97-digit number)
17309005056040314448…38635520634305751041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.461 × 10⁹⁶(97-digit number)
34618010112080628897…77271041268611502081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.923 × 10⁹⁶(97-digit number)
69236020224161257794…54542082537223004161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.384 × 10⁹⁷(98-digit number)
13847204044832251558…09084165074446008321
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,987,203 XPM·at block #6,842,856 · 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