Block #1,713,735

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/12/2016, 12:20:58 PM · Difficulty 10.6516 · 5,111,844 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c18c51568af6546c62d925f286299d354931b42a1324e9ef9dec7a754f7f36c8

Height

#1,713,735

Difficulty

10.651619

Transactions

49

Size

15.04 KB

Version

2

Bits

0aa6d079

Nonce

16,129,348

Timestamp

8/12/2016, 12:20:58 PM

Confirmations

5,111,844

Merkle Root

65ee4910988556a493612209467e9dcad77139798c39057322707712f909a3eb
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.442 × 10⁹⁵(96-digit number)
44427585405605740766…07362962335899977601
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.442 × 10⁹⁵(96-digit number)
44427585405605740766…07362962335899977601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.885 × 10⁹⁵(96-digit number)
88855170811211481532…14725924671799955201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.777 × 10⁹⁶(97-digit number)
17771034162242296306…29451849343599910401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.554 × 10⁹⁶(97-digit number)
35542068324484592612…58903698687199820801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.108 × 10⁹⁶(97-digit number)
71084136648969185225…17807397374399641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.421 × 10⁹⁷(98-digit number)
14216827329793837045…35614794748799283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.843 × 10⁹⁷(98-digit number)
28433654659587674090…71229589497598566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.686 × 10⁹⁷(98-digit number)
56867309319175348180…42459178995197132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.137 × 10⁹⁸(99-digit number)
11373461863835069636…84918357990394265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.274 × 10⁹⁸(99-digit number)
22746923727670139272…69836715980788531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.549 × 10⁹⁸(99-digit number)
45493847455340278544…39673431961577062401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,848,733 XPM·at block #6,825,578 · 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