Block #2,177,348

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2017, 12:37:50 PM · Difficulty 10.9225 · 4,660,841 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1279e43e27bfeb5fa622ab58ba77494e33534aa806353d52ebe39907474d3e1a

Height

#2,177,348

Difficulty

10.922505

Transactions

2

Size

425 B

Version

2

Bits

0aec294e

Nonce

1,456,569,322

Timestamp

6/25/2017, 12:37:50 PM

Confirmations

4,660,841

Merkle Root

c14348c7a9301e30362045a2ff899bce044490250a60ce45b13b1986580059fb
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.981 × 10⁹⁵(96-digit number)
49811966516843715737…40778041328578509441
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.981 × 10⁹⁵(96-digit number)
49811966516843715737…40778041328578509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.962 × 10⁹⁵(96-digit number)
99623933033687431475…81556082657157018881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.992 × 10⁹⁶(97-digit number)
19924786606737486295…63112165314314037761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.984 × 10⁹⁶(97-digit number)
39849573213474972590…26224330628628075521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.969 × 10⁹⁶(97-digit number)
79699146426949945180…52448661257256151041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.593 × 10⁹⁷(98-digit number)
15939829285389989036…04897322514512302081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.187 × 10⁹⁷(98-digit number)
31879658570779978072…09794645029024604161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.375 × 10⁹⁷(98-digit number)
63759317141559956144…19589290058049208321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.275 × 10⁹⁸(99-digit number)
12751863428311991228…39178580116098416641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.550 × 10⁹⁸(99-digit number)
25503726856623982457…78357160232196833281
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,949,787 XPM·at block #6,838,188 · 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