Block #1,769,972

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/19/2016, 12:14:41 PM · Difficulty 10.7439 · 5,040,014 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
91f0e2cd66a9fdb7a4b973df3b15e3545e7df6bc7d4499739e90ca908323ba19

Height

#1,769,972

Difficulty

10.743903

Transactions

4

Size

875 B

Version

2

Bits

0abe7074

Nonce

627,784,574

Timestamp

9/19/2016, 12:14:41 PM

Confirmations

5,040,014

Merkle Root

45d961a0eef7851ff14906f5ba961afb5cda55b94349b3143d8d5fb842d3919a
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.

6.425 × 10⁹¹(92-digit number)
64256249956154506881…67091898730935489751
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
6.425 × 10⁹¹(92-digit number)
64256249956154506881…67091898730935489751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.285 × 10⁹²(93-digit number)
12851249991230901376…34183797461870979501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.570 × 10⁹²(93-digit number)
25702499982461802752…68367594923741959001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.140 × 10⁹²(93-digit number)
51404999964923605505…36735189847483918001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.028 × 10⁹³(94-digit number)
10280999992984721101…73470379694967836001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.056 × 10⁹³(94-digit number)
20561999985969442202…46940759389935672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.112 × 10⁹³(94-digit number)
41123999971938884404…93881518779871344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.224 × 10⁹³(94-digit number)
82247999943877768808…87763037559742688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.644 × 10⁹⁴(95-digit number)
16449599988775553761…75526075119485376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.289 × 10⁹⁴(95-digit number)
32899199977551107523…51052150238970752001
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,723,961 XPM·at block #6,809,985 · 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.

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