Block #1,695,248

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/30/2016, 9:37:20 AM · Difficulty 10.6768 · 5,113,312 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ed4258189a15fec69e7493c393ef554626048a91f3865dd00319422f5fc76296

Height

#1,695,248

Difficulty

10.676780

Transactions

3

Size

3.89 KB

Version

2

Bits

0aad4172

Nonce

2,093,079,543

Timestamp

7/30/2016, 9:37:20 AM

Confirmations

5,113,312

Merkle Root

4a8ece4a1e19ebce3f60b663f45c657271cbeafc00d07c6dad8a21b77f90ae22
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.811 × 10⁹⁷(98-digit number)
18115045834219207568…32460516952106291201
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.811 × 10⁹⁷(98-digit number)
18115045834219207568…32460516952106291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.623 × 10⁹⁷(98-digit number)
36230091668438415137…64921033904212582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.246 × 10⁹⁷(98-digit number)
72460183336876830275…29842067808425164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.449 × 10⁹⁸(99-digit number)
14492036667375366055…59684135616850329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.898 × 10⁹⁸(99-digit number)
28984073334750732110…19368271233700659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.796 × 10⁹⁸(99-digit number)
57968146669501464220…38736542467401318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.159 × 10⁹⁹(100-digit number)
11593629333900292844…77473084934802636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.318 × 10⁹⁹(100-digit number)
23187258667800585688…54946169869605273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.637 × 10⁹⁹(100-digit number)
46374517335601171376…09892339739210547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.274 × 10⁹⁹(100-digit number)
92749034671202342752…19784679478421094401
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,712,538 XPM·at block #6,808,559 · 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