Block #1,291,549

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/21/2015, 9:01:59 AM · Difficulty 10.8398 · 5,552,204 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6485aca0c236a41389e0df78eef1b1a2feb491151e3527494d9975c1da3e0a2

Height

#1,291,549

Difficulty

10.839784

Transactions

2

Size

1.05 KB

Version

2

Bits

0ad6fc13

Nonce

1,139,562,668

Timestamp

10/21/2015, 9:01:59 AM

Confirmations

5,552,204

Merkle Root

aa1c1c8aef287d531a20b76a4ea835e3f3c00b50b50d49df1e2811cbcfdecf60
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.

3.243 × 10⁹⁵(96-digit number)
32436088412635912155…89490435040436660161
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
3.243 × 10⁹⁵(96-digit number)
32436088412635912155…89490435040436660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.487 × 10⁹⁵(96-digit number)
64872176825271824310…78980870080873320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.297 × 10⁹⁶(97-digit number)
12974435365054364862…57961740161746640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.594 × 10⁹⁶(97-digit number)
25948870730108729724…15923480323493281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.189 × 10⁹⁶(97-digit number)
51897741460217459448…31846960646986562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.037 × 10⁹⁷(98-digit number)
10379548292043491889…63693921293973125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.075 × 10⁹⁷(98-digit number)
20759096584086983779…27387842587946250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.151 × 10⁹⁷(98-digit number)
41518193168173967558…54775685175892500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.303 × 10⁹⁷(98-digit number)
83036386336347935116…09551370351785000961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.660 × 10⁹⁸(99-digit number)
16607277267269587023…19102740703570001921
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,994,395 XPM·at block #6,843,752 · 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