Block #1,396,723

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2016, 2:16:09 AM · Difficulty 10.8099 · 5,430,077 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c255d2674c77f7cea0aebc7939037a4e1dd131c18b4735ae886ba72b23d8c8d

Height

#1,396,723

Difficulty

10.809897

Transactions

48

Size

15.09 KB

Version

2

Bits

0acf556a

Nonce

62,506,795

Timestamp

1/3/2016, 2:16:09 AM

Confirmations

5,430,077

Merkle Root

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

4.865 × 10⁹⁵(96-digit number)
48652362627603547440…21614093628722222081
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
4.865 × 10⁹⁵(96-digit number)
48652362627603547440…21614093628722222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.730 × 10⁹⁵(96-digit number)
97304725255207094880…43228187257444444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.946 × 10⁹⁶(97-digit number)
19460945051041418976…86456374514888888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.892 × 10⁹⁶(97-digit number)
38921890102082837952…72912749029777776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.784 × 10⁹⁶(97-digit number)
77843780204165675904…45825498059555553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.556 × 10⁹⁷(98-digit number)
15568756040833135180…91650996119111106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.113 × 10⁹⁷(98-digit number)
31137512081666270361…83301992238222213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.227 × 10⁹⁷(98-digit number)
62275024163332540723…66603984476444426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.245 × 10⁹⁸(99-digit number)
12455004832666508144…33207968952888852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.491 × 10⁹⁸(99-digit number)
24910009665333016289…66415937905777704961
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,858,563 XPM·at block #6,826,799 · 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