Block #3,012,761

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2019, 1:32:50 AM · Difficulty 11.1741 · 3,830,227 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5aa31588308b1629a88551602496a9ccd31d0a1059b69a1881d680ed266717ef

Height

#3,012,761

Difficulty

11.174085

Transactions

18

Size

5.94 KB

Version

2

Bits

0b2c90dc

Nonce

1,636,223,221

Timestamp

1/17/2019, 1:32:50 AM

Confirmations

3,830,227

Merkle Root

2f145002b094329e162276b433ed167e4a932dd9d6d71433537b0441eb4069a1
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.358 × 10⁹³(94-digit number)
93580331457820259037…46213941820109943101
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.358 × 10⁹³(94-digit number)
93580331457820259037…46213941820109943101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.871 × 10⁹⁴(95-digit number)
18716066291564051807…92427883640219886201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.743 × 10⁹⁴(95-digit number)
37432132583128103615…84855767280439772401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.486 × 10⁹⁴(95-digit number)
74864265166256207230…69711534560879544801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.497 × 10⁹⁵(96-digit number)
14972853033251241446…39423069121759089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.994 × 10⁹⁵(96-digit number)
29945706066502482892…78846138243518179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.989 × 10⁹⁵(96-digit number)
59891412133004965784…57692276487036358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.197 × 10⁹⁶(97-digit number)
11978282426600993156…15384552974072716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.395 × 10⁹⁶(97-digit number)
23956564853201986313…30769105948145433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.791 × 10⁹⁶(97-digit number)
47913129706403972627…61538211896290867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.582 × 10⁹⁶(97-digit number)
95826259412807945254…23076423792581734401
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,988,259 XPM·at block #6,842,987 · 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