Block #2,687,402

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2018, 4:50:46 PM · Difficulty 11.6798 · 4,155,993 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b25e4d11287dacd53e0cad40c7b7e2987893afb68ee9c73313465ee48ecd8cd7

Height

#2,687,402

Difficulty

11.679777

Transactions

3

Size

997 B

Version

2

Bits

0bae05d8

Nonce

1,139,225,820

Timestamp

6/1/2018, 4:50:46 PM

Confirmations

4,155,993

Merkle Root

37d763d78117dfa382088e444876fe249d34ff35992184e6d5945b683734a129
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.920 × 10⁹⁴(95-digit number)
19201903418750600360…36965573921025570961
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.920 × 10⁹⁴(95-digit number)
19201903418750600360…36965573921025570961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.840 × 10⁹⁴(95-digit number)
38403806837501200720…73931147842051141921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.680 × 10⁹⁴(95-digit number)
76807613675002401440…47862295684102283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.536 × 10⁹⁵(96-digit number)
15361522735000480288…95724591368204567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.072 × 10⁹⁵(96-digit number)
30723045470000960576…91449182736409135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.144 × 10⁹⁵(96-digit number)
61446090940001921152…82898365472818270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.228 × 10⁹⁶(97-digit number)
12289218188000384230…65796730945636541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.457 × 10⁹⁶(97-digit number)
24578436376000768461…31593461891273082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.915 × 10⁹⁶(97-digit number)
49156872752001536922…63186923782546165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.831 × 10⁹⁶(97-digit number)
98313745504003073844…26373847565092331521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.966 × 10⁹⁷(98-digit number)
19662749100800614768…52747695130184663041
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,991,524 XPM·at block #6,843,394 · 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