Block #3,022,888

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2019, 2:58:08 AM · Difficulty 11.1682 · 3,819,140 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b24624008371cc0e509fc89e3c11b543cf0de77bb90cc4deb9882b9867265c3

Height

#3,022,888

Difficulty

11.168225

Transactions

5

Size

2.05 KB

Version

2

Bits

0b2b10c5

Nonce

1,765,757,869

Timestamp

1/24/2019, 2:58:08 AM

Confirmations

3,819,140

Merkle Root

f350bd2e713b9523d13186297c6f884e50dfd5d2abb44a78680bbdf748045888
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.

1.429 × 10⁹⁵(96-digit number)
14291922899403775515…03070491791321623531
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
1.429 × 10⁹⁵(96-digit number)
14291922899403775515…03070491791321623531
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.858 × 10⁹⁵(96-digit number)
28583845798807551030…06140983582643247061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.716 × 10⁹⁵(96-digit number)
57167691597615102060…12281967165286494121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.143 × 10⁹⁶(97-digit number)
11433538319523020412…24563934330572988241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.286 × 10⁹⁶(97-digit number)
22867076639046040824…49127868661145976481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.573 × 10⁹⁶(97-digit number)
45734153278092081648…98255737322291952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.146 × 10⁹⁶(97-digit number)
91468306556184163296…96511474644583905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.829 × 10⁹⁷(98-digit number)
18293661311236832659…93022949289167811841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.658 × 10⁹⁷(98-digit number)
36587322622473665318…86045898578335623681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.317 × 10⁹⁷(98-digit number)
73174645244947330637…72091797156671247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.463 × 10⁹⁸(99-digit number)
14634929048989466127…44183594313342494721
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,610 XPM·at block #6,842,027 · 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