Block #1,386,820

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2015, 3:08:47 AM · Difficulty 10.8142 · 5,439,837 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e084d5f302cd2ab71cef7d2dd8fcc50847e65569a23a6c7ee9cc3cd1ff93c7c

Height

#1,386,820

Difficulty

10.814183

Transactions

3

Size

5.35 KB

Version

2

Bits

0ad06e4c

Nonce

1,445,982,767

Timestamp

12/27/2015, 3:08:47 AM

Confirmations

5,439,837

Merkle Root

1a1fd84b7da77811171e11579b03609ee57266319b912e995c2ce85316e7714d
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.675 × 10⁹⁴(95-digit number)
66757161065977308702…64909721378525716481
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.675 × 10⁹⁴(95-digit number)
66757161065977308702…64909721378525716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.335 × 10⁹⁵(96-digit number)
13351432213195461740…29819442757051432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.670 × 10⁹⁵(96-digit number)
26702864426390923481…59638885514102865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.340 × 10⁹⁵(96-digit number)
53405728852781846962…19277771028205731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.068 × 10⁹⁶(97-digit number)
10681145770556369392…38555542056411463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.136 × 10⁹⁶(97-digit number)
21362291541112738784…77111084112822927361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.272 × 10⁹⁶(97-digit number)
42724583082225477569…54222168225645854721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.544 × 10⁹⁶(97-digit number)
85449166164450955139…08444336451291709441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.708 × 10⁹⁷(98-digit number)
17089833232890191027…16888672902583418881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.417 × 10⁹⁷(98-digit number)
34179666465780382055…33777345805166837761
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,857,406 XPM·at block #6,826,656 · 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