Block #2,476,727

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2018, 4:31:19 AM · Difficulty 10.9646 · 4,365,054 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a89acd024a33ce345eb52e024aff6611fef2c0a3b6672c572a541450ddfd975b

Height

#2,476,727

Difficulty

10.964611

Transactions

49

Size

16.50 KB

Version

2

Bits

0af6f0b9

Nonce

259,550,704

Timestamp

1/17/2018, 4:31:19 AM

Confirmations

4,365,054

Merkle Root

4427b1122f2b42f745747550d9aef1b9498e019f6f3c907cb8f2bfbf718ee902
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.

1.741 × 10⁹⁴(95-digit number)
17418197987844757101…79845160709977719341
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
1.741 × 10⁹⁴(95-digit number)
17418197987844757101…79845160709977719341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.483 × 10⁹⁴(95-digit number)
34836395975689514203…59690321419955438681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.967 × 10⁹⁴(95-digit number)
69672791951379028407…19380642839910877361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.393 × 10⁹⁵(96-digit number)
13934558390275805681…38761285679821754721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.786 × 10⁹⁵(96-digit number)
27869116780551611363…77522571359643509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.573 × 10⁹⁵(96-digit number)
55738233561103222726…55045142719287018881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.114 × 10⁹⁶(97-digit number)
11147646712220644545…10090285438574037761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.229 × 10⁹⁶(97-digit number)
22295293424441289090…20180570877148075521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.459 × 10⁹⁶(97-digit number)
44590586848882578180…40361141754296151041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.918 × 10⁹⁶(97-digit number)
89181173697765156361…80722283508592302081
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,978,625 XPM·at block #6,841,780 · 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