Block #3,010,453

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2019, 8:26:49 AM · Difficulty 11.1998 · 3,833,259 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
215f439e6d36a66294813ce501ca80bd589e04f80763305aea0e4d37fc0d21e1

Height

#3,010,453

Difficulty

11.199808

Transactions

27

Size

5.65 KB

Version

2

Bits

0b3326a2

Nonce

1,625,805,958

Timestamp

1/15/2019, 8:26:49 AM

Confirmations

3,833,259

Merkle Root

492d2b1405f6b51ac5bbe02f0a90aa11f3e44e41deac8034b0a4a5452a1a975a
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.

2.355 × 10⁹²(93-digit number)
23553335716468796321…52632785244565429051
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
2.355 × 10⁹²(93-digit number)
23553335716468796321…52632785244565429051
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.710 × 10⁹²(93-digit number)
47106671432937592643…05265570489130858101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.421 × 10⁹²(93-digit number)
94213342865875185287…10531140978261716201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.884 × 10⁹³(94-digit number)
18842668573175037057…21062281956523432401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.768 × 10⁹³(94-digit number)
37685337146350074114…42124563913046864801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.537 × 10⁹³(94-digit number)
75370674292700148229…84249127826093729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.507 × 10⁹⁴(95-digit number)
15074134858540029645…68498255652187459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.014 × 10⁹⁴(95-digit number)
30148269717080059291…36996511304374918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.029 × 10⁹⁴(95-digit number)
60296539434160118583…73993022608749836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.205 × 10⁹⁵(96-digit number)
12059307886832023716…47986045217499673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.411 × 10⁹⁵(96-digit number)
24118615773664047433…95972090434999347201
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,994,066 XPM·at block #6,843,711 · 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