Block #1,705,850

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2016, 12:21:19 AM · Difficulty 10.6532 · 5,108,989 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4a27341810b964c8931b323ed089027084b0cf5e4e8a2d352eaa93947869dd57

Height

#1,705,850

Difficulty

10.653204

Transactions

2

Size

1020 B

Version

2

Bits

0aa73866

Nonce

808,588,546

Timestamp

8/7/2016, 12:21:19 AM

Confirmations

5,108,989

Merkle Root

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

3.175 × 10⁹⁶(97-digit number)
31750136323387483668…06218641774030917121
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
3.175 × 10⁹⁶(97-digit number)
31750136323387483668…06218641774030917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.350 × 10⁹⁶(97-digit number)
63500272646774967336…12437283548061834241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.270 × 10⁹⁷(98-digit number)
12700054529354993467…24874567096123668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.540 × 10⁹⁷(98-digit number)
25400109058709986934…49749134192247336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.080 × 10⁹⁷(98-digit number)
50800218117419973869…99498268384494673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.016 × 10⁹⁸(99-digit number)
10160043623483994773…98996536768989347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.032 × 10⁹⁸(99-digit number)
20320087246967989547…97993073537978695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.064 × 10⁹⁸(99-digit number)
40640174493935979095…95986147075957391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.128 × 10⁹⁸(99-digit number)
81280348987871958191…91972294151914782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.625 × 10⁹⁹(100-digit number)
16256069797574391638…83944588303829565441
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,762,795 XPM·at block #6,814,838 · 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