Block #2,716,665

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/22/2018, 4:33:57 PM · Difficulty 11.6136 · 4,117,053 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79e9f018f804ed93cc6da1863dff7578916d2dad37838123e7922e1c4aca4204

Height

#2,716,665

Difficulty

11.613623

Transactions

4

Size

1.26 KB

Version

2

Bits

0b9d166c

Nonce

1,115,359,018

Timestamp

6/22/2018, 4:33:57 PM

Confirmations

4,117,053

Merkle Root

f529ed09a21770ac94780a501427de161057d36b5a2b7b4f314f9c3562d09dc7
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.312 × 10⁹⁴(95-digit number)
23129387116817738116…26431006499197158401
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.312 × 10⁹⁴(95-digit number)
23129387116817738116…26431006499197158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.625 × 10⁹⁴(95-digit number)
46258774233635476232…52862012998394316801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.251 × 10⁹⁴(95-digit number)
92517548467270952465…05724025996788633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.850 × 10⁹⁵(96-digit number)
18503509693454190493…11448051993577267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.700 × 10⁹⁵(96-digit number)
37007019386908380986…22896103987154534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.401 × 10⁹⁵(96-digit number)
74014038773816761972…45792207974309068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.480 × 10⁹⁶(97-digit number)
14802807754763352394…91584415948618137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.960 × 10⁹⁶(97-digit number)
29605615509526704788…83168831897236275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.921 × 10⁹⁶(97-digit number)
59211231019053409577…66337663794472550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.184 × 10⁹⁷(98-digit number)
11842246203810681915…32675327588945100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.368 × 10⁹⁷(98-digit number)
23684492407621363831…65350655177890201601
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,913,967 XPM·at block #6,833,717 · 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