Block #2,856,987

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/27/2018, 10:08:45 AM · Difficulty 11.6896 · 3,976,939 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ec9fe712a2f25c1da9d6aa8d00e1ee96489e204d3c60c9acbbdcd462a6382cc

Height

#2,856,987

Difficulty

11.689598

Transactions

2

Size

1.57 KB

Version

2

Bits

0bb0897e

Nonce

1,955,580,153

Timestamp

9/27/2018, 10:08:45 AM

Confirmations

3,976,939

Merkle Root

36f131c85c28078586f5464e0b873d4f8f9d8c87da932f6b1097c592fad26168
Transactions (2)
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.377 × 10⁹⁴(95-digit number)
13772598809162560962…40528533065924479141
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.377 × 10⁹⁴(95-digit number)
13772598809162560962…40528533065924479141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.754 × 10⁹⁴(95-digit number)
27545197618325121924…81057066131848958281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.509 × 10⁹⁴(95-digit number)
55090395236650243849…62114132263697916561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.101 × 10⁹⁵(96-digit number)
11018079047330048769…24228264527395833121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.203 × 10⁹⁵(96-digit number)
22036158094660097539…48456529054791666241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.407 × 10⁹⁵(96-digit number)
44072316189320195079…96913058109583332481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.814 × 10⁹⁵(96-digit number)
88144632378640390159…93826116219166664961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.762 × 10⁹⁶(97-digit number)
17628926475728078031…87652232438333329921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.525 × 10⁹⁶(97-digit number)
35257852951456156063…75304464876666659841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.051 × 10⁹⁶(97-digit number)
70515705902912312127…50608929753333319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.410 × 10⁹⁷(98-digit number)
14103141180582462425…01217859506666639361
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,915,636 XPM·at block #6,833,925 · 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