Block #1,681,648

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2016, 11:47:08 AM · Difficulty 10.7165 · 5,149,325 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f31dd72dc272808c4d445cb317448f535cfd3a2c26ac86c2c1620e2ef51468e2

Height

#1,681,648

Difficulty

10.716542

Transactions

10

Size

3.36 KB

Version

2

Bits

0ab76f47

Nonce

118,262,517

Timestamp

7/20/2016, 11:47:08 AM

Confirmations

5,149,325

Merkle Root

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

5.419 × 10⁹⁵(96-digit number)
54190506412333825724…26938687220843776001
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
5.419 × 10⁹⁵(96-digit number)
54190506412333825724…26938687220843776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.083 × 10⁹⁶(97-digit number)
10838101282466765144…53877374441687552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.167 × 10⁹⁶(97-digit number)
21676202564933530289…07754748883375104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.335 × 10⁹⁶(97-digit number)
43352405129867060579…15509497766750208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.670 × 10⁹⁶(97-digit number)
86704810259734121159…31018995533500416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.734 × 10⁹⁷(98-digit number)
17340962051946824231…62037991067000832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.468 × 10⁹⁷(98-digit number)
34681924103893648463…24075982134001664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.936 × 10⁹⁷(98-digit number)
69363848207787296927…48151964268003328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.387 × 10⁹⁸(99-digit number)
13872769641557459385…96303928536006656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.774 × 10⁹⁸(99-digit number)
27745539283114918771…92607857072013312001
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,891,923 XPM·at block #6,830,972 · 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