Block #2,557,473

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2018, 7:16:46 PM · Difficulty 10.9914 · 4,273,868 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cbc45e5010a7b83834a235ce8487f52fcb6dd1bc194308651f838394ca64ae14

Height

#2,557,473

Difficulty

10.991384

Transactions

2

Size

1.42 KB

Version

2

Bits

0afdcb56

Nonce

710,165,749

Timestamp

3/9/2018, 7:16:46 PM

Confirmations

4,273,868

Merkle Root

2a7b4dc7cd9808944b863b564938a83d988eeaa0f8a047613e37ce50d74f91e9
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.

9.182 × 10⁹³(94-digit number)
91827598475746477570…85608505927536280881
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
9.182 × 10⁹³(94-digit number)
91827598475746477570…85608505927536280881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.836 × 10⁹⁴(95-digit number)
18365519695149295514…71217011855072561761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.673 × 10⁹⁴(95-digit number)
36731039390298591028…42434023710145123521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.346 × 10⁹⁴(95-digit number)
73462078780597182056…84868047420290247041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.469 × 10⁹⁵(96-digit number)
14692415756119436411…69736094840580494081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.938 × 10⁹⁵(96-digit number)
29384831512238872822…39472189681160988161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.876 × 10⁹⁵(96-digit number)
58769663024477745644…78944379362321976321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.175 × 10⁹⁶(97-digit number)
11753932604895549128…57888758724643952641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.350 × 10⁹⁶(97-digit number)
23507865209791098257…15777517449287905281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.701 × 10⁹⁶(97-digit number)
47015730419582196515…31555034898575810561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.403 × 10⁹⁶(97-digit number)
94031460839164393031…63110069797151621121
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,894,882 XPM·at block #6,831,340 · 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