Block #1,393,298

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2015, 5:26:42 PM · Difficulty 10.8091 · 5,421,612 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ae0c4e5c2010eed5813b67d5ca1620b23a53615667d2401d01e29ede0ca2370

Height

#1,393,298

Difficulty

10.809106

Transactions

3

Size

4.40 KB

Version

2

Bits

0acf218a

Nonce

180,666,764

Timestamp

12/31/2015, 5:26:42 PM

Confirmations

5,421,612

Merkle Root

0bab9ffa0738006ff4817787561fbda2c2f4dddf65d88fc5665bf1475a0b116e
Transactions (3)
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.466 × 10⁹⁵(96-digit number)
14660264534969104695…21755976414504227321
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.466 × 10⁹⁵(96-digit number)
14660264534969104695…21755976414504227321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.932 × 10⁹⁵(96-digit number)
29320529069938209390…43511952829008454641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.864 × 10⁹⁵(96-digit number)
58641058139876418781…87023905658016909281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.172 × 10⁹⁶(97-digit number)
11728211627975283756…74047811316033818561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.345 × 10⁹⁶(97-digit number)
23456423255950567512…48095622632067637121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.691 × 10⁹⁶(97-digit number)
46912846511901135024…96191245264135274241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.382 × 10⁹⁶(97-digit number)
93825693023802270049…92382490528270548481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.876 × 10⁹⁷(98-digit number)
18765138604760454009…84764981056541096961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.753 × 10⁹⁷(98-digit number)
37530277209520908019…69529962113082193921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.506 × 10⁹⁷(98-digit number)
75060554419041816039…39059924226164387841
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,763,371 XPM·at block #6,814,909 · 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