Block #2,155,792

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/11/2017, 5:04:20 AM · Difficulty 10.9059 · 4,661,033 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2589802992c3be26759bc3634b4a04b822055678d5acf4790d556c74e161dcd8

Height

#2,155,792

Difficulty

10.905925

Transactions

11

Size

5.44 KB

Version

2

Bits

0ae7eab4

Nonce

357,880,700

Timestamp

6/11/2017, 5:04:20 AM

Confirmations

4,661,033

Merkle Root

07995990dc72859dc5e53c961ac14f43eb8f4fdf6b4dd572860b4101aa6f137a
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.

8.667 × 10⁹⁴(95-digit number)
86673332325982765001…45065306613250685281
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
8.667 × 10⁹⁴(95-digit number)
86673332325982765001…45065306613250685281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.733 × 10⁹⁵(96-digit number)
17334666465196553000…90130613226501370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.466 × 10⁹⁵(96-digit number)
34669332930393106000…80261226453002741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.933 × 10⁹⁵(96-digit number)
69338665860786212001…60522452906005482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.386 × 10⁹⁶(97-digit number)
13867733172157242400…21044905812010964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.773 × 10⁹⁶(97-digit number)
27735466344314484800…42089811624021928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.547 × 10⁹⁶(97-digit number)
55470932688628969600…84179623248043857921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.109 × 10⁹⁷(98-digit number)
11094186537725793920…68359246496087715841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.218 × 10⁹⁷(98-digit number)
22188373075451587840…36718492992175431681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.437 × 10⁹⁷(98-digit number)
44376746150903175680…73436985984350863361
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,778,640 XPM·at block #6,816,824 · 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