Block #2,340,233

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/17/2017, 10:43:23 AM · Difficulty 10.9107 · 4,501,778 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3d51e7a65de72cb4054ab88b3f20d13383ed6977c821a3bfeab2695845625771

Height

#2,340,233

Difficulty

10.910749

Transactions

36

Size

13.65 KB

Version

2

Bits

0ae926e0

Nonce

1,071,154,764

Timestamp

10/17/2017, 10:43:23 AM

Confirmations

4,501,778

Merkle Root

015147ce7d119da94f5fecd5ec02e27d1c8bf56c4f943b24047ef94eda32cd5b
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.632 × 10⁹⁵(96-digit number)
26329371533689969163…83696676962143372801
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.632 × 10⁹⁵(96-digit number)
26329371533689969163…83696676962143372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.265 × 10⁹⁵(96-digit number)
52658743067379938327…67393353924286745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.053 × 10⁹⁶(97-digit number)
10531748613475987665…34786707848573491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.106 × 10⁹⁶(97-digit number)
21063497226951975330…69573415697146982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.212 × 10⁹⁶(97-digit number)
42126994453903950661…39146831394293964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.425 × 10⁹⁶(97-digit number)
84253988907807901323…78293662788587929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.685 × 10⁹⁷(98-digit number)
16850797781561580264…56587325577175859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.370 × 10⁹⁷(98-digit number)
33701595563123160529…13174651154351718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.740 × 10⁹⁷(98-digit number)
67403191126246321058…26349302308703436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.348 × 10⁹⁸(99-digit number)
13480638225249264211…52698604617406873601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,980,474 XPM·at block #6,842,010 · 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