Block #2,646,892

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 2:30:42 PM · Difficulty 11.7558 · 4,183,735 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a2c2492f47e54859dfcee49193c56daae064867eda733413856a87836958116

Height

#2,646,892

Difficulty

11.755807

Transactions

26

Size

8.91 KB

Version

2

Bits

0bc17c8c

Nonce

723,228,409

Timestamp

5/3/2018, 2:30:42 PM

Confirmations

4,183,735

Merkle Root

339722284a55f0214db53f8c7abd013b62187cf561adc8b4893b380f662fbbe7
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.482 × 10⁹⁶(97-digit number)
14829069359658001953…30301826022399091201
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.482 × 10⁹⁶(97-digit number)
14829069359658001953…30301826022399091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.965 × 10⁹⁶(97-digit number)
29658138719316003906…60603652044798182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.931 × 10⁹⁶(97-digit number)
59316277438632007812…21207304089596364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.186 × 10⁹⁷(98-digit number)
11863255487726401562…42414608179192729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.372 × 10⁹⁷(98-digit number)
23726510975452803125…84829216358385459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.745 × 10⁹⁷(98-digit number)
47453021950905606250…69658432716770918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.490 × 10⁹⁷(98-digit number)
94906043901811212500…39316865433541836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.898 × 10⁹⁸(99-digit number)
18981208780362242500…78633730867083673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.796 × 10⁹⁸(99-digit number)
37962417560724485000…57267461734167347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.592 × 10⁹⁸(99-digit number)
75924835121448970000…14534923468334694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.518 × 10⁹⁹(100-digit number)
15184967024289794000…29069846936669388801
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,889,137 XPM·at block #6,830,626 · 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