Block #2,643,464

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 3:00:16 AM · Difficulty 11.6841 · 4,201,793 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
64b5d6ebcd9664fea856b4da31707eceab506c4aeb867fc2664066d38e8225d8

Height

#2,643,464

Difficulty

11.684127

Transactions

6

Size

1.82 KB

Version

2

Bits

0baf22f5

Nonce

57,639,670

Timestamp

5/2/2018, 3:00:16 AM

Confirmations

4,201,793

Merkle Root

4a8002429f212e9ae992cd0942c7de49fcd8aa91512072f99fe722acd032fd00
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.

2.263 × 10⁹⁵(96-digit number)
22632125098292216458…69816193693404048001
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
2.263 × 10⁹⁵(96-digit number)
22632125098292216458…69816193693404048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.526 × 10⁹⁵(96-digit number)
45264250196584432917…39632387386808096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.052 × 10⁹⁵(96-digit number)
90528500393168865834…79264774773616192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.810 × 10⁹⁶(97-digit number)
18105700078633773166…58529549547232384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.621 × 10⁹⁶(97-digit number)
36211400157267546333…17059099094464768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.242 × 10⁹⁶(97-digit number)
72422800314535092667…34118198188929536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.448 × 10⁹⁷(98-digit number)
14484560062907018533…68236396377859072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.896 × 10⁹⁷(98-digit number)
28969120125814037066…36472792755718144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.793 × 10⁹⁷(98-digit number)
57938240251628074133…72945585511436288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.158 × 10⁹⁸(99-digit number)
11587648050325614826…45891171022872576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.317 × 10⁹⁸(99-digit number)
23175296100651229653…91782342045745152001
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:58,006,489 XPM·at block #6,845,256 · 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