Block #2,475,833

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2018, 2:39:39 PM · Difficulty 10.9641 · 4,367,283 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a3d96a5b912ce9ad7c417b5303ed3c931e22df01a5946e7c37ec445a947a229f

Height

#2,475,833

Difficulty

10.964133

Transactions

32

Size

7.76 KB

Version

2

Bits

0af6d173

Nonce

1,220,441,186

Timestamp

1/16/2018, 2:39:39 PM

Confirmations

4,367,283

Merkle Root

5e9349c1003eb5d591f160a2f06381fd7503e007a5ee3a1d748722587c76ce53
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.128 × 10⁹⁵(96-digit number)
41285967167119688393…58693314479693044481
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.128 × 10⁹⁵(96-digit number)
41285967167119688393…58693314479693044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.257 × 10⁹⁵(96-digit number)
82571934334239376787…17386628959386088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.651 × 10⁹⁶(97-digit number)
16514386866847875357…34773257918772177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.302 × 10⁹⁶(97-digit number)
33028773733695750714…69546515837544355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.605 × 10⁹⁶(97-digit number)
66057547467391501429…39093031675088711681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.321 × 10⁹⁷(98-digit number)
13211509493478300285…78186063350177423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.642 × 10⁹⁷(98-digit number)
26423018986956600571…56372126700354846721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.284 × 10⁹⁷(98-digit number)
52846037973913201143…12744253400709693441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.056 × 10⁹⁸(99-digit number)
10569207594782640228…25488506801419386881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.113 × 10⁹⁸(99-digit number)
21138415189565280457…50977013602838773761
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,989,294 XPM·at block #6,843,115 · 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