Block #2,696,953

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/8/2018, 12:55:08 PM · Difficulty 11.6610 · 4,139,966 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
edc568ad5afb4db121ab7063fac67fbdcd96697dffa96ad0e6ac44906dc75f0f

Height

#2,696,953

Difficulty

11.660953

Transactions

2

Size

1.14 KB

Version

2

Bits

0ba93436

Nonce

38,879,445

Timestamp

6/8/2018, 12:55:08 PM

Confirmations

4,139,966

Merkle Root

77674e68d902d8905fd9cb95ab2393440e1a00a8abd1aa2c23cc687cc8e9ed46
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.

3.327 × 10⁹⁶(97-digit number)
33277725108426586776…52868311813837186561
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
3.327 × 10⁹⁶(97-digit number)
33277725108426586776…52868311813837186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.655 × 10⁹⁶(97-digit number)
66555450216853173553…05736623627674373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.331 × 10⁹⁷(98-digit number)
13311090043370634710…11473247255348746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.662 × 10⁹⁷(98-digit number)
26622180086741269421…22946494510697492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.324 × 10⁹⁷(98-digit number)
53244360173482538842…45892989021394984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.064 × 10⁹⁸(99-digit number)
10648872034696507768…91785978042789969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.129 × 10⁹⁸(99-digit number)
21297744069393015537…83571956085579939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.259 × 10⁹⁸(99-digit number)
42595488138786031074…67143912171159879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.519 × 10⁹⁸(99-digit number)
85190976277572062148…34287824342319759361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.703 × 10⁹⁹(100-digit number)
17038195255514412429…68575648684639518721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.407 × 10⁹⁹(100-digit number)
34076390511028824859…37151297369279037441
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,939,646 XPM·at block #6,836,918 · 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