Block #2,238,883

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2017, 2:24:20 AM · Difficulty 10.9463 · 4,587,337 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eae299170172ae24599f88cea7d7f7bee0cdbe1f0ec7a3ce9f01bd2286d2442c

Height

#2,238,883

Difficulty

10.946254

Transactions

3

Size

1.22 KB

Version

2

Bits

0af23db4

Nonce

244,574,458

Timestamp

8/6/2017, 2:24:20 AM

Confirmations

4,587,337

Merkle Root

558388884f61593aa370cc283b820e977a8e5d413af08acbebec4ec39464e88d
Transactions (3)
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.

6.133 × 10⁹⁵(96-digit number)
61339127882199736915…50551201084044610561
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
6.133 × 10⁹⁵(96-digit number)
61339127882199736915…50551201084044610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.226 × 10⁹⁶(97-digit number)
12267825576439947383…01102402168089221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.453 × 10⁹⁶(97-digit number)
24535651152879894766…02204804336178442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.907 × 10⁹⁶(97-digit number)
49071302305759789532…04409608672356884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.814 × 10⁹⁶(97-digit number)
98142604611519579064…08819217344713768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.962 × 10⁹⁷(98-digit number)
19628520922303915812…17638434689427537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.925 × 10⁹⁷(98-digit number)
39257041844607831625…35276869378855075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.851 × 10⁹⁷(98-digit number)
78514083689215663251…70553738757710151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.570 × 10⁹⁸(99-digit number)
15702816737843132650…41107477515420303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.140 × 10⁹⁸(99-digit number)
31405633475686265300…82214955030840606721
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,853,893 XPM·at block #6,826,219 · 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