Block #2,816,514

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/30/2018, 7:41:58 AM · Difficulty 11.6877 · 4,009,597 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3c011ace304771cd0a69b6d51588422f67eb1506bd0c5c8eaa5e6b664456b244

Height

#2,816,514

Difficulty

11.687724

Transactions

3

Size

653 B

Version

2

Bits

0bb00eb3

Nonce

881,148,320

Timestamp

8/30/2018, 7:41:58 AM

Confirmations

4,009,597

Merkle Root

0f824b43ec357266a5f22d459d442dd9a4a433851017a84e713d339f3ad586ae
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.125 × 10⁹⁴(95-digit number)
41256560584284891574…32644169835998709841
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.125 × 10⁹⁴(95-digit number)
41256560584284891574…32644169835998709841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.251 × 10⁹⁴(95-digit number)
82513121168569783149…65288339671997419681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.650 × 10⁹⁵(96-digit number)
16502624233713956629…30576679343994839361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.300 × 10⁹⁵(96-digit number)
33005248467427913259…61153358687989678721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.601 × 10⁹⁵(96-digit number)
66010496934855826519…22306717375979357441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.320 × 10⁹⁶(97-digit number)
13202099386971165303…44613434751958714881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.640 × 10⁹⁶(97-digit number)
26404198773942330607…89226869503917429761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.280 × 10⁹⁶(97-digit number)
52808397547884661215…78453739007834859521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.056 × 10⁹⁷(98-digit number)
10561679509576932243…56907478015669719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.112 × 10⁹⁷(98-digit number)
21123359019153864486…13814956031339438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.224 × 10⁹⁷(98-digit number)
42246718038307728972…27629912062678876161
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,853,012 XPM·at block #6,826,110 · 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