Block #2,726,231

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/29/2018, 5:44:52 AM · Difficulty 11.6243 · 4,113,740 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9c9cc34d1530c10edd5cc5ab5f3ce2efd933ca336b93e998f42f583b7482c96

Height

#2,726,231

Difficulty

11.624292

Transactions

2

Size

1016 B

Version

2

Bits

0b9fd1a0

Nonce

1,482,604,777

Timestamp

6/29/2018, 5:44:52 AM

Confirmations

4,113,740

Merkle Root

3276b5fa94812e5d60e55dd7faf756daaaf5296fb5cd87cc48be483dfd80cfaa
Transactions (2)
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.

4.298 × 10⁹¹(92-digit number)
42987121013840790306…33630181868102188641
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
4.298 × 10⁹¹(92-digit number)
42987121013840790306…33630181868102188641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.597 × 10⁹¹(92-digit number)
85974242027681580613…67260363736204377281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.719 × 10⁹²(93-digit number)
17194848405536316122…34520727472408754561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.438 × 10⁹²(93-digit number)
34389696811072632245…69041454944817509121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.877 × 10⁹²(93-digit number)
68779393622145264490…38082909889635018241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.375 × 10⁹³(94-digit number)
13755878724429052898…76165819779270036481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.751 × 10⁹³(94-digit number)
27511757448858105796…52331639558540072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.502 × 10⁹³(94-digit number)
55023514897716211592…04663279117080145921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.100 × 10⁹⁴(95-digit number)
11004702979543242318…09326558234160291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.200 × 10⁹⁴(95-digit number)
22009405959086484636…18653116468320583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.401 × 10⁹⁴(95-digit number)
44018811918172969273…37306232936641167361
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,964,073 XPM·at block #6,839,970 · 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