Block #2,646,225

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 6:30:13 AM · Difficulty 11.7466 · 4,187,517 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cce45f526904a476fa3df3a13b11ccf2783475f289686b8d968b14514de33584

Height

#2,646,225

Difficulty

11.746618

Transactions

9

Size

2.96 KB

Version

2

Bits

0bbf2259

Nonce

170,409,267

Timestamp

5/3/2018, 6:30:13 AM

Confirmations

4,187,517

Merkle Root

75204e70c8ac4da17a614ae3c8acfab68530f2ab0972b56f8f88d8edc7c441b6
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.508 × 10⁹⁷(98-digit number)
45083031381709909297…35741397602213498881
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.508 × 10⁹⁷(98-digit number)
45083031381709909297…35741397602213498881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.016 × 10⁹⁷(98-digit number)
90166062763419818595…71482795204426997761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.803 × 10⁹⁸(99-digit number)
18033212552683963719…42965590408853995521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.606 × 10⁹⁸(99-digit number)
36066425105367927438…85931180817707991041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.213 × 10⁹⁸(99-digit number)
72132850210735854876…71862361635415982081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.442 × 10⁹⁹(100-digit number)
14426570042147170975…43724723270831964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.885 × 10⁹⁹(100-digit number)
28853140084294341950…87449446541663928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.770 × 10⁹⁹(100-digit number)
57706280168588683901…74898893083327856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.154 × 10¹⁰⁰(101-digit number)
11541256033717736780…49797786166655713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.308 × 10¹⁰⁰(101-digit number)
23082512067435473560…99595572333311426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.616 × 10¹⁰⁰(101-digit number)
46165024134870947121…99191144666622853121
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,914,154 XPM·at block #6,833,741 · 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