Block #2,375,419

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/11/2017, 8:31:06 PM · Difficulty 10.8835 · 4,469,945 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
717968f59b8bfebc3c9ab0e2d25958aa0f2d01836cc26533ad0d780ff46d9673

Height

#2,375,419

Difficulty

10.883457

Transactions

41

Size

9.34 KB

Version

2

Bits

0ae22a42

Nonce

1,983,891,030

Timestamp

11/11/2017, 8:31:06 PM

Confirmations

4,469,945

Merkle Root

a6b845a586dec1ff176a46e0c293efb3f265922435d81c646b535cb3fc62f74b
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.252 × 10⁹⁷(98-digit number)
12528295272965064093…39856444684212531201
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.252 × 10⁹⁷(98-digit number)
12528295272965064093…39856444684212531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.505 × 10⁹⁷(98-digit number)
25056590545930128187…79712889368425062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.011 × 10⁹⁷(98-digit number)
50113181091860256375…59425778736850124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.002 × 10⁹⁸(99-digit number)
10022636218372051275…18851557473700249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.004 × 10⁹⁸(99-digit number)
20045272436744102550…37703114947400499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.009 × 10⁹⁸(99-digit number)
40090544873488205100…75406229894800998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.018 × 10⁹⁸(99-digit number)
80181089746976410201…50812459789601996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.603 × 10⁹⁹(100-digit number)
16036217949395282040…01624919579203993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.207 × 10⁹⁹(100-digit number)
32072435898790564080…03249839158407987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.414 × 10⁹⁹(100-digit number)
64144871797581128161…06499678316815974401
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:58,007,356 XPM·at block #6,845,363 · 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