Block #2,314,462

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/29/2017, 3:54:06 PM · Difficulty 10.9069 · 4,512,380 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
40fe5d6b58e43b74fbe019385fc9cbedaaaa6ca74296e9c5279de0e6027fa263

Height

#2,314,462

Difficulty

10.906943

Transactions

4

Size

4.18 KB

Version

2

Bits

0ae82d6f

Nonce

913,188,259

Timestamp

9/29/2017, 3:54:06 PM

Confirmations

4,512,380

Merkle Root

f71faadf72a884fd501d04fee3a3a35b3048862df2a2c17f340d65cd6c77036f
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.731 × 10⁹⁴(95-digit number)
17312944026711366864…92796734549161846001
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.731 × 10⁹⁴(95-digit number)
17312944026711366864…92796734549161846001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.462 × 10⁹⁴(95-digit number)
34625888053422733728…85593469098323692001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.925 × 10⁹⁴(95-digit number)
69251776106845467456…71186938196647384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.385 × 10⁹⁵(96-digit number)
13850355221369093491…42373876393294768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.770 × 10⁹⁵(96-digit number)
27700710442738186982…84747752786589536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.540 × 10⁹⁵(96-digit number)
55401420885476373965…69495505573179072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.108 × 10⁹⁶(97-digit number)
11080284177095274793…38991011146358144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.216 × 10⁹⁶(97-digit number)
22160568354190549586…77982022292716288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.432 × 10⁹⁶(97-digit number)
44321136708381099172…55964044585432576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.864 × 10⁹⁶(97-digit number)
88642273416762198344…11928089170865152001
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,858,901 XPM·at block #6,826,841 · 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