Block #2,815,894

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2018, 9:58:44 PM · Difficulty 11.6854 · 4,026,763 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a57d432355345a317998d312bfb0da21427e4e1a2be988c44b9e2c5344836b8

Height

#2,815,894

Difficulty

11.685419

Transactions

11

Size

4.06 KB

Version

2

Bits

0baf7798

Nonce

797,973,507

Timestamp

8/29/2018, 9:58:44 PM

Confirmations

4,026,763

Merkle Root

83943e57bf3e1b18271411a7ef29a14d643d1b2dffceb981aab2be87cc0e7864
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.

9.383 × 10⁹⁴(95-digit number)
93831904510559599332…36257622318372389121
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
9.383 × 10⁹⁴(95-digit number)
93831904510559599332…36257622318372389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.876 × 10⁹⁵(96-digit number)
18766380902111919866…72515244636744778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.753 × 10⁹⁵(96-digit number)
37532761804223839733…45030489273489556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.506 × 10⁹⁵(96-digit number)
75065523608447679466…90060978546979112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.501 × 10⁹⁶(97-digit number)
15013104721689535893…80121957093958225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.002 × 10⁹⁶(97-digit number)
30026209443379071786…60243914187916451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.005 × 10⁹⁶(97-digit number)
60052418886758143572…20487828375832903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.201 × 10⁹⁷(98-digit number)
12010483777351628714…40975656751665807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.402 × 10⁹⁷(98-digit number)
24020967554703257429…81951313503331614721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.804 × 10⁹⁷(98-digit number)
48041935109406514858…63902627006663229441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.608 × 10⁹⁷(98-digit number)
96083870218813029716…27805254013326458881
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,691 XPM·at block #6,842,656 · 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