Block #2,314,724

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/29/2017, 8:02:49 PM · Difficulty 10.9071 · 4,519,015 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
796fb1f9843bc55a3f270faad832c306a40dc2152a1a08dd7b60a0667cbb9d14

Height

#2,314,724

Difficulty

10.907142

Transactions

3

Size

903 B

Version

2

Bits

0ae83a7c

Nonce

419,050,878

Timestamp

9/29/2017, 8:02:49 PM

Confirmations

4,519,015

Merkle Root

06f1ec22bb046c32f1c0b6b23ee99879305419d8c873f6b3478c4e492ca4b816
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.078 × 10⁹⁴(95-digit number)
30786797790625445711…98843762468277094281
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.078 × 10⁹⁴(95-digit number)
30786797790625445711…98843762468277094281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.157 × 10⁹⁴(95-digit number)
61573595581250891422…97687524936554188561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.231 × 10⁹⁵(96-digit number)
12314719116250178284…95375049873108377121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.462 × 10⁹⁵(96-digit number)
24629438232500356569…90750099746216754241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.925 × 10⁹⁵(96-digit number)
49258876465000713138…81500199492433508481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.851 × 10⁹⁵(96-digit number)
98517752930001426276…63000398984867016961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.970 × 10⁹⁶(97-digit number)
19703550586000285255…26000797969734033921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.940 × 10⁹⁶(97-digit number)
39407101172000570510…52001595939468067841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.881 × 10⁹⁶(97-digit number)
78814202344001141021…04003191878936135681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.576 × 10⁹⁷(98-digit number)
15762840468800228204…08006383757872271361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.152 × 10⁹⁷(98-digit number)
31525680937600456408…16012767515744542721
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,914,129 XPM·at block #6,833,738 · 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