Block #1,252,075

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/25/2015, 12:39:53 AM · Difficulty 10.7813 · 5,565,240 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
26611c46878d3393928d6ab2d7369fc2bfef77c08aee0d9fe49a31da7d87219d

Height

#1,252,075

Difficulty

10.781296

Transactions

2

Size

2.04 KB

Version

2

Bits

0ac80301

Nonce

1,018,582,377

Timestamp

9/25/2015, 12:39:53 AM

Confirmations

5,565,240

Merkle Root

074ba97201c133ccf581a2135cf1b63beeeefcb4a2d3235aa805da7bafbe9f1f
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.999 × 10⁹⁶(97-digit number)
19991023655939834374…27812550337975418881
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.999 × 10⁹⁶(97-digit number)
19991023655939834374…27812550337975418881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.998 × 10⁹⁶(97-digit number)
39982047311879668749…55625100675950837761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.996 × 10⁹⁶(97-digit number)
79964094623759337499…11250201351901675521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.599 × 10⁹⁷(98-digit number)
15992818924751867499…22500402703803351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.198 × 10⁹⁷(98-digit number)
31985637849503734999…45000805407606702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.397 × 10⁹⁷(98-digit number)
63971275699007469999…90001610815213404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.279 × 10⁹⁸(99-digit number)
12794255139801493999…80003221630426808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.558 × 10⁹⁸(99-digit number)
25588510279602987999…60006443260853616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.117 × 10⁹⁸(99-digit number)
51177020559205975999…20012886521707233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.023 × 10⁹⁹(100-digit number)
10235404111841195199…40025773043414466561
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,782,565 XPM·at block #6,817,314 · 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