Block #1,701,415

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/3/2016, 6:41:41 PM · Difficulty 10.6681 · 5,140,797 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79aa27b51e7fcc97ef157965a9c357f6bc8a0a130414582b9479735512cf1a91

Height

#1,701,415

Difficulty

10.668054

Transactions

7

Size

2.78 KB

Version

2

Bits

0aab0597

Nonce

1,679,881,897

Timestamp

8/3/2016, 6:41:41 PM

Confirmations

5,140,797

Merkle Root

3a4b56b62c8265af3c408024e5981fbe280cdd2283953d6ad2bf0188eba46f1a
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.

2.040 × 10⁹⁰(91-digit number)
20407998151808629257…50003830925176812801
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
2.040 × 10⁹⁰(91-digit number)
20407998151808629257…50003830925176812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.081 × 10⁹⁰(91-digit number)
40815996303617258514…00007661850353625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.163 × 10⁹⁰(91-digit number)
81631992607234517028…00015323700707251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.632 × 10⁹¹(92-digit number)
16326398521446903405…00030647401414502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.265 × 10⁹¹(92-digit number)
32652797042893806811…00061294802829004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.530 × 10⁹¹(92-digit number)
65305594085787613623…00122589605658009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.306 × 10⁹²(93-digit number)
13061118817157522724…00245179211316019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.612 × 10⁹²(93-digit number)
26122237634315045449…00490358422632038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.224 × 10⁹²(93-digit number)
52244475268630090898…00980716845264076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.044 × 10⁹³(94-digit number)
10448895053726018179…01961433690528153601
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,982,093 XPM·at block #6,842,211 · 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