Block #2,718,442

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2018, 9:42:24 PM · Difficulty 11.6161 · 4,115,456 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f650d84d26f729b336d9c2a3ad2aeb0ff6e6cee71ceb74454a8b77407e990bb8

Height

#2,718,442

Difficulty

11.616084

Transactions

6

Size

2.11 KB

Version

2

Bits

0b9db7ad

Nonce

1,358,899,297

Timestamp

6/23/2018, 9:42:24 PM

Confirmations

4,115,456

Merkle Root

0ba49b68d5798cf29a1e7c3e9e2212e532b9040435cd85d1de410ac03c1b0cfb
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.

3.579 × 10⁹⁷(98-digit number)
35797025917465763630…01245020020484935681
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
3.579 × 10⁹⁷(98-digit number)
35797025917465763630…01245020020484935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.159 × 10⁹⁷(98-digit number)
71594051834931527260…02490040040969871361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.431 × 10⁹⁸(99-digit number)
14318810366986305452…04980080081939742721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.863 × 10⁹⁸(99-digit number)
28637620733972610904…09960160163879485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.727 × 10⁹⁸(99-digit number)
57275241467945221808…19920320327758970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.145 × 10⁹⁹(100-digit number)
11455048293589044361…39840640655517941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.291 × 10⁹⁹(100-digit number)
22910096587178088723…79681281311035883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.582 × 10⁹⁹(100-digit number)
45820193174356177446…59362562622071767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.164 × 10⁹⁹(100-digit number)
91640386348712354893…18725125244143534081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.832 × 10¹⁰⁰(101-digit number)
18328077269742470978…37450250488287068161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.665 × 10¹⁰⁰(101-digit number)
36656154539484941957…74900500976574136321
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,409 XPM·at block #6,833,897 · 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