Block #2,651,485

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2018, 8:45:29 PM · Difficulty 11.7510 · 4,180,082 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e456cb2f14996f9da49b23b7678c2015935078b44a740685967214d79328db06

Height

#2,651,485

Difficulty

11.750984

Transactions

2

Size

872 B

Version

2

Bits

0bc04080

Nonce

1,407,218,948

Timestamp

5/6/2018, 8:45:29 PM

Confirmations

4,180,082

Merkle Root

9a804edbf1a46fa460d2e1a087eeb3474e9096b607903276bd33d0db011ac56e
Transactions (2)
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.079 × 10⁹⁴(95-digit number)
40790395050374342272…17583484959496601601
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.079 × 10⁹⁴(95-digit number)
40790395050374342272…17583484959496601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.158 × 10⁹⁴(95-digit number)
81580790100748684545…35166969918993203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.631 × 10⁹⁵(96-digit number)
16316158020149736909…70333939837986406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.263 × 10⁹⁵(96-digit number)
32632316040299473818…40667879675972812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.526 × 10⁹⁵(96-digit number)
65264632080598947636…81335759351945625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.305 × 10⁹⁶(97-digit number)
13052926416119789527…62671518703891251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.610 × 10⁹⁶(97-digit number)
26105852832239579054…25343037407782502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.221 × 10⁹⁶(97-digit number)
52211705664479158109…50686074815565004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.044 × 10⁹⁷(98-digit number)
10442341132895831621…01372149631130009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.088 × 10⁹⁷(98-digit number)
20884682265791663243…02744299262260019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.176 × 10⁹⁷(98-digit number)
41769364531583326487…05488598524520038401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,896,628 XPM·at block #6,831,566 · 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