Block #1,705,975

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2016, 3:03:11 AM · Difficulty 10.6508 · 5,135,530 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4707fcdfe7df0cdfc66c99d36ba6b867f00097d28acd411c918cde630f005b0f

Height

#1,705,975

Difficulty

10.650829

Transactions

2

Size

1.43 KB

Version

2

Bits

0aa69cbb

Nonce

330,291,999

Timestamp

8/7/2016, 3:03:11 AM

Confirmations

5,135,530

Merkle Root

60e5312fb5e0bab59991043f901e032e2388a493824298ac357d94f421043bfd
Transactions (2)
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.186 × 10⁹⁴(95-digit number)
41861856669877962311…46940442603475795601
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.186 × 10⁹⁴(95-digit number)
41861856669877962311…46940442603475795601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.372 × 10⁹⁴(95-digit number)
83723713339755924622…93880885206951591201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.674 × 10⁹⁵(96-digit number)
16744742667951184924…87761770413903182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.348 × 10⁹⁵(96-digit number)
33489485335902369849…75523540827806364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.697 × 10⁹⁵(96-digit number)
66978970671804739698…51047081655612729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.339 × 10⁹⁶(97-digit number)
13395794134360947939…02094163311225459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.679 × 10⁹⁶(97-digit number)
26791588268721895879…04188326622450918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.358 × 10⁹⁶(97-digit number)
53583176537443791758…08376653244901836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.071 × 10⁹⁷(98-digit number)
10716635307488758351…16753306489803673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.143 × 10⁹⁷(98-digit number)
21433270614977516703…33506612979607347201
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,976,419 XPM·at block #6,841,504 · 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