Block #2,258,776

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/19/2017, 1:12:39 PM · Difficulty 10.9521 · 4,583,302 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
72015151d1845d14b0e05f8fe809bf2e45e2f2074c92ce04e845eb3ecbfb1c69

Height

#2,258,776

Difficulty

10.952130

Transactions

2

Size

2.01 KB

Version

2

Bits

0af3bec5

Nonce

352,323,482

Timestamp

8/19/2017, 1:12:39 PM

Confirmations

4,583,302

Merkle Root

904ee8b9511a3571f9e3f8fc82dbc8a3ad4011c99a902e7282bb9c7cceeec0e2
Transactions (2)
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.410 × 10⁹⁶(97-digit number)
24101034914875810283…22641577424755351041
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.410 × 10⁹⁶(97-digit number)
24101034914875810283…22641577424755351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.820 × 10⁹⁶(97-digit number)
48202069829751620567…45283154849510702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.640 × 10⁹⁶(97-digit number)
96404139659503241134…90566309699021404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.928 × 10⁹⁷(98-digit number)
19280827931900648226…81132619398042808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.856 × 10⁹⁷(98-digit number)
38561655863801296453…62265238796085616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.712 × 10⁹⁷(98-digit number)
77123311727602592907…24530477592171233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.542 × 10⁹⁸(99-digit number)
15424662345520518581…49060955184342466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.084 × 10⁹⁸(99-digit number)
30849324691041037163…98121910368684933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.169 × 10⁹⁸(99-digit number)
61698649382082074326…96243820737369866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.233 × 10⁹⁹(100-digit number)
12339729876416414865…92487641474739732481
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,981,008 XPM·at block #6,842,077 · 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