Block #2,601,727

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/5/2018, 8:06:11 PM · Difficulty 11.3156 · 4,240,302 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69ab0a05313427e0ae14983f7791f57e8362fc3af0131420182570534bc7abcd

Height

#2,601,727

Difficulty

11.315592

Transactions

6

Size

2.13 KB

Version

2

Bits

0b50caa3

Nonce

852,758,597

Timestamp

4/5/2018, 8:06:11 PM

Confirmations

4,240,302

Merkle Root

818741098bf23363232ea14dc8808347f06534342b1d9d30fa23d5fef61e84cd
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.

7.863 × 10⁹⁷(98-digit number)
78632076882201220261…46798967201930526721
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
7.863 × 10⁹⁷(98-digit number)
78632076882201220261…46798967201930526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.572 × 10⁹⁸(99-digit number)
15726415376440244052…93597934403861053441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.145 × 10⁹⁸(99-digit number)
31452830752880488104…87195868807722106881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.290 × 10⁹⁸(99-digit number)
62905661505760976209…74391737615444213761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.258 × 10⁹⁹(100-digit number)
12581132301152195241…48783475230888427521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.516 × 10⁹⁹(100-digit number)
25162264602304390483…97566950461776855041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.032 × 10⁹⁹(100-digit number)
50324529204608780967…95133900923553710081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.006 × 10¹⁰⁰(101-digit number)
10064905840921756193…90267801847107420161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.012 × 10¹⁰⁰(101-digit number)
20129811681843512387…80535603694214840321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.025 × 10¹⁰⁰(101-digit number)
40259623363687024774…61071207388429680641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.051 × 10¹⁰⁰(101-digit number)
80519246727374049548…22142414776859361281
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,980,619 XPM·at block #6,842,028 · 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