Block #2,490,778

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2018, 7:52:21 AM · Difficulty 10.9707 · 4,343,150 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
511ddfe8ac26539415a5f87a27db8c6b74dfd7ca154f3d41e64c2483ddb01781

Height

#2,490,778

Difficulty

10.970719

Transactions

5

Size

48.18 KB

Version

2

Bits

0af8810f

Nonce

539,171,760

Timestamp

1/26/2018, 7:52:21 AM

Confirmations

4,343,150

Merkle Root

5b029c201ea52b8fd91d12764582e567dcdf7ad9d29e4a78c3b1beae3bc37de3
Transactions (5)
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.900 × 10⁹⁵(96-digit number)
19002712587497092602…61676769991747926401
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.900 × 10⁹⁵(96-digit number)
19002712587497092602…61676769991747926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.800 × 10⁹⁵(96-digit number)
38005425174994185204…23353539983495852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.601 × 10⁹⁵(96-digit number)
76010850349988370409…46707079966991705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.520 × 10⁹⁶(97-digit number)
15202170069997674081…93414159933983411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.040 × 10⁹⁶(97-digit number)
30404340139995348163…86828319867966822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.080 × 10⁹⁶(97-digit number)
60808680279990696327…73656639735933644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.216 × 10⁹⁷(98-digit number)
12161736055998139265…47313279471867289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.432 × 10⁹⁷(98-digit number)
24323472111996278530…94626558943734579201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.864 × 10⁹⁷(98-digit number)
48646944223992557061…89253117887469158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.729 × 10⁹⁷(98-digit number)
97293888447985114123…78506235774938316801
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,915,652 XPM·at block #6,833,927 · 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