Block #2,709,344

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/17/2018, 7:21:59 PM · Difficulty 11.5908 · 4,121,396 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
261afaecc4cff2c4aa72eaa47c97a48baae2ea5457228c7de827d46086a84967

Height

#2,709,344

Difficulty

11.590779

Transactions

5

Size

2.04 KB

Version

2

Bits

0b973d4c

Nonce

2,088,905,473

Timestamp

6/17/2018, 7:21:59 PM

Confirmations

4,121,396

Merkle Root

8d20536dc82ceeab3bc8e3fc0636aa1f879875323a3040b5572f685afe6730f7
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.165 × 10⁹⁵(96-digit number)
11658842673587744467…35432453554911239521
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.165 × 10⁹⁵(96-digit number)
11658842673587744467…35432453554911239521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.331 × 10⁹⁵(96-digit number)
23317685347175488934…70864907109822479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.663 × 10⁹⁵(96-digit number)
46635370694350977868…41729814219644958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.327 × 10⁹⁵(96-digit number)
93270741388701955737…83459628439289916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.865 × 10⁹⁶(97-digit number)
18654148277740391147…66919256878579832321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.730 × 10⁹⁶(97-digit number)
37308296555480782294…33838513757159664641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.461 × 10⁹⁶(97-digit number)
74616593110961564589…67677027514319329281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.492 × 10⁹⁷(98-digit number)
14923318622192312917…35354055028638658561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.984 × 10⁹⁷(98-digit number)
29846637244384625835…70708110057277317121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.969 × 10⁹⁷(98-digit number)
59693274488769251671…41416220114554634241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.193 × 10⁹⁸(99-digit number)
11938654897753850334…82832440229109268481
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,890,057 XPM·at block #6,830,739 · 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