Block #2,345,938

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/21/2017, 7:38:47 PM · Difficulty 10.8998 · 4,486,351 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3bdd3644a4025e77604142ffce1026a21bc2022866463aa5d99f9913fc7dccc3

Height

#2,345,938

Difficulty

10.899823

Transactions

30

Size

7.09 KB

Version

2

Bits

0ae65ad2

Nonce

363,631,291

Timestamp

10/21/2017, 7:38:47 PM

Confirmations

4,486,351

Merkle Root

5b2c518617d83ecc3ed01d316956e18b05d13362421e509a8f9430000d3336fc
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.608 × 10⁹³(94-digit number)
96084059140436945453…62081259657316640241
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.608 × 10⁹³(94-digit number)
96084059140436945453…62081259657316640241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.921 × 10⁹⁴(95-digit number)
19216811828087389090…24162519314633280481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.843 × 10⁹⁴(95-digit number)
38433623656174778181…48325038629266560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.686 × 10⁹⁴(95-digit number)
76867247312349556362…96650077258533121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.537 × 10⁹⁵(96-digit number)
15373449462469911272…93300154517066243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.074 × 10⁹⁵(96-digit number)
30746898924939822545…86600309034132487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.149 × 10⁹⁵(96-digit number)
61493797849879645090…73200618068264975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.229 × 10⁹⁶(97-digit number)
12298759569975929018…46401236136529950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.459 × 10⁹⁶(97-digit number)
24597519139951858036…92802472273059901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.919 × 10⁹⁶(97-digit number)
49195038279903716072…85604944546119802881
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,902,456 XPM·at block #6,832,288 · 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