Block #2,238,207

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/5/2017, 3:24:25 PM · Difficulty 10.9461 · 4,589,023 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f7ea41359f267d102042edb0daa1ff0f29b80acc529eb316c914e508aa2e5045

Height

#2,238,207

Difficulty

10.946067

Transactions

7

Size

3.83 KB

Version

2

Bits

0af23170

Nonce

749,236,624

Timestamp

8/5/2017, 3:24:25 PM

Confirmations

4,589,023

Merkle Root

c28d80291083cb159ac40bb00e08f9b3831b679d5a9729f97c8009c84aee9052
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.184 × 10⁹⁷(98-digit number)
11840638274770260556…69622701938015948801
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.184 × 10⁹⁷(98-digit number)
11840638274770260556…69622701938015948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.368 × 10⁹⁷(98-digit number)
23681276549540521113…39245403876031897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.736 × 10⁹⁷(98-digit number)
47362553099081042227…78490807752063795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.472 × 10⁹⁷(98-digit number)
94725106198162084455…56981615504127590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.894 × 10⁹⁸(99-digit number)
18945021239632416891…13963231008255180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.789 × 10⁹⁸(99-digit number)
37890042479264833782…27926462016510361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.578 × 10⁹⁸(99-digit number)
75780084958529667564…55852924033020723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.515 × 10⁹⁹(100-digit number)
15156016991705933512…11705848066041446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.031 × 10⁹⁹(100-digit number)
30312033983411867025…23411696132082892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.062 × 10⁹⁹(100-digit number)
60624067966823734051…46823392264165785601
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,861,940 XPM·at block #6,827,229 · 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