Block #2,712,337

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/19/2018, 7:36:35 PM · Difficulty 11.5987 · 4,120,689 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
46440106f9111a5c1e59d494503bfbde709e91e32cbb240be882af585fa06d4a

Height

#2,712,337

Difficulty

11.598650

Transactions

9

Size

2.42 KB

Version

2

Bits

0b994121

Nonce

23,718,130

Timestamp

6/19/2018, 7:36:35 PM

Confirmations

4,120,689

Merkle Root

f9c990c9f5f4468cb6cedf95961956ba8d88117860920f441316363b5cd1c2f2
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.280 × 10⁹⁴(95-digit number)
22804464668770619087…84170128304083558401
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.280 × 10⁹⁴(95-digit number)
22804464668770619087…84170128304083558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.560 × 10⁹⁴(95-digit number)
45608929337541238175…68340256608167116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.121 × 10⁹⁴(95-digit number)
91217858675082476351…36680513216334233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.824 × 10⁹⁵(96-digit number)
18243571735016495270…73361026432668467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.648 × 10⁹⁵(96-digit number)
36487143470032990540…46722052865336934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.297 × 10⁹⁵(96-digit number)
72974286940065981081…93444105730673868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.459 × 10⁹⁶(97-digit number)
14594857388013196216…86888211461347737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.918 × 10⁹⁶(97-digit number)
29189714776026392432…73776422922695475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.837 × 10⁹⁶(97-digit number)
58379429552052784864…47552845845390950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.167 × 10⁹⁷(98-digit number)
11675885910410556972…95105691690781900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.335 × 10⁹⁷(98-digit number)
23351771820821113945…90211383381563801601
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,908,384 XPM·at block #6,833,025 · 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