Block #3,006,611

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2019, 4:21:56 PM · Difficulty 11.1999 · 3,835,344 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f65b2f652eb7a159e01616aaf91c82c1de67e21f7b132579a5b31e290dd8f7a5

Height

#3,006,611

Difficulty

11.199907

Transactions

19

Size

5.72 KB

Version

2

Bits

0b332d1a

Nonce

1,627,559,174

Timestamp

1/12/2019, 4:21:56 PM

Confirmations

3,835,344

Merkle Root

49abe0ccc43a30387f8e1b9ba4cf703aaacc468272fe369d8887b28bb2f1a7a3
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.065 × 10⁹⁷(98-digit number)
20651592967840845234…40384967523052410881
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.065 × 10⁹⁷(98-digit number)
20651592967840845234…40384967523052410881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.130 × 10⁹⁷(98-digit number)
41303185935681690468…80769935046104821761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.260 × 10⁹⁷(98-digit number)
82606371871363380936…61539870092209643521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.652 × 10⁹⁸(99-digit number)
16521274374272676187…23079740184419287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.304 × 10⁹⁸(99-digit number)
33042548748545352374…46159480368838574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.608 × 10⁹⁸(99-digit number)
66085097497090704749…92318960737677148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.321 × 10⁹⁹(100-digit number)
13217019499418140949…84637921475354296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.643 × 10⁹⁹(100-digit number)
26434038998836281899…69275842950708592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.286 × 10⁹⁹(100-digit number)
52868077997672563799…38551685901417185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.057 × 10¹⁰⁰(101-digit number)
10573615599534512759…77103371802834370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.114 × 10¹⁰⁰(101-digit number)
21147231199069025519…54206743605668741121
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,021 XPM·at block #6,841,954 · 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