Block #1,162,674

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2015, 2:33:57 PM · Difficulty 10.9353 · 5,643,769 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6599aacceb32606c1382ba85e7510b5d214928b2e499c18e5e7e81a693423fd2

Height

#1,162,674

Difficulty

10.935322

Transactions

7

Size

1.66 KB

Version

2

Bits

0aef714a

Nonce

1,490,363,208

Timestamp

7/20/2015, 2:33:57 PM

Confirmations

5,643,769

Merkle Root

c978c8bf9a0d8ac73a245fdae9fe3758ba760c2944e5ca977f8ac8a132a8cb7b
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.346 × 10⁹²(93-digit number)
63468542583806303106…72617535115469574161
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.346 × 10⁹²(93-digit number)
63468542583806303106…72617535115469574161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.269 × 10⁹³(94-digit number)
12693708516761260621…45235070230939148321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.538 × 10⁹³(94-digit number)
25387417033522521242…90470140461878296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.077 × 10⁹³(94-digit number)
50774834067045042485…80940280923756593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.015 × 10⁹⁴(95-digit number)
10154966813409008497…61880561847513186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.030 × 10⁹⁴(95-digit number)
20309933626818016994…23761123695026373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.061 × 10⁹⁴(95-digit number)
40619867253636033988…47522247390052746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.123 × 10⁹⁴(95-digit number)
81239734507272067976…95044494780105492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.624 × 10⁹⁵(96-digit number)
16247946901454413595…90088989560210984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.249 × 10⁹⁵(96-digit number)
32495893802908827190…80177979120421969921
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,695,633 XPM·at block #6,806,442 · 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.

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