Block #1,739,780

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2016, 7:42:39 PM · Difficulty 10.7216 · 5,085,353 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b8615799c8f414985c64005e7b4df087f9ca8d9ad29e33e4e667a16eabe6f20

Height

#1,739,780

Difficulty

10.721597

Transactions

2

Size

1.81 KB

Version

2

Bits

0ab8ba9b

Nonce

1,316,228,927

Timestamp

8/29/2016, 7:42:39 PM

Confirmations

5,085,353

Merkle Root

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

1.449 × 10⁹⁷(98-digit number)
14494429850912547347…77349696018631475201
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
1.449 × 10⁹⁷(98-digit number)
14494429850912547347…77349696018631475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.898 × 10⁹⁷(98-digit number)
28988859701825094695…54699392037262950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.797 × 10⁹⁷(98-digit number)
57977719403650189390…09398784074525900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.159 × 10⁹⁸(99-digit number)
11595543880730037878…18797568149051801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.319 × 10⁹⁸(99-digit number)
23191087761460075756…37595136298103603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.638 × 10⁹⁸(99-digit number)
46382175522920151512…75190272596207206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.276 × 10⁹⁸(99-digit number)
92764351045840303024…50380545192414412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.855 × 10⁹⁹(100-digit number)
18552870209168060604…00761090384828825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.710 × 10⁹⁹(100-digit number)
37105740418336121209…01522180769657651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.421 × 10⁹⁹(100-digit number)
74211480836672242419…03044361539315302401
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,845,149 XPM·at block #6,825,132 · 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