Block #2,675,139

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2018, 10:56:55 PM · Difficulty 11.6999 · 4,162,006 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
37ddac24a53aeae8ecaccab29458763834ea2e3faf5d2bf40e6e9b4fe771b3dc

Height

#2,675,139

Difficulty

11.699860

Transactions

39

Size

12.71 KB

Version

2

Bits

0bb32a0d

Nonce

415,389,361

Timestamp

5/23/2018, 10:56:55 PM

Confirmations

4,162,006

Merkle Root

03aaaa35e13dbfc02b575e527de131463a9894ad4234a604cfac61f93c3a9bf9
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.573 × 10⁹⁷(98-digit number)
45734074221215170426…08051604573841459201
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.573 × 10⁹⁷(98-digit number)
45734074221215170426…08051604573841459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.146 × 10⁹⁷(98-digit number)
91468148442430340853…16103209147682918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.829 × 10⁹⁸(99-digit number)
18293629688486068170…32206418295365836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.658 × 10⁹⁸(99-digit number)
36587259376972136341…64412836590731673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.317 × 10⁹⁸(99-digit number)
73174518753944272683…28825673181463347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.463 × 10⁹⁹(100-digit number)
14634903750788854536…57651346362926694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.926 × 10⁹⁹(100-digit number)
29269807501577709073…15302692725853388801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.853 × 10⁹⁹(100-digit number)
58539615003155418146…30605385451706777601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.170 × 10¹⁰⁰(101-digit number)
11707923000631083629…61210770903413555201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.341 × 10¹⁰⁰(101-digit number)
23415846001262167258…22421541806827110401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.683 × 10¹⁰⁰(101-digit number)
46831692002524334517…44843083613654220801
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,941,472 XPM·at block #6,837,144 · 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