Block #1,700,460

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/3/2016, 2:49:44 AM · Difficulty 10.6678 · 5,124,106 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
47782004d02be22ccb5f9138606c80ac71dd4613b20a986717003d5bc07da900

Height

#1,700,460

Difficulty

10.667843

Transactions

2

Size

4.32 KB

Version

2

Bits

0aaaf7c9

Nonce

404,373,180

Timestamp

8/3/2016, 2:49:44 AM

Confirmations

5,124,106

Merkle Root

9ccace7902b2a7b135032940524df0ccbed0349168594b3b90aff3c4c922527b
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.

2.523 × 10⁹⁵(96-digit number)
25233284667520487620…76490390176143818241
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
2.523 × 10⁹⁵(96-digit number)
25233284667520487620…76490390176143818241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.046 × 10⁹⁵(96-digit number)
50466569335040975241…52980780352287636481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.009 × 10⁹⁶(97-digit number)
10093313867008195048…05961560704575272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.018 × 10⁹⁶(97-digit number)
20186627734016390096…11923121409150545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.037 × 10⁹⁶(97-digit number)
40373255468032780193…23846242818301091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.074 × 10⁹⁶(97-digit number)
80746510936065560386…47692485636602183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.614 × 10⁹⁷(98-digit number)
16149302187213112077…95384971273204367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.229 × 10⁹⁷(98-digit number)
32298604374426224154…90769942546408734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.459 × 10⁹⁷(98-digit number)
64597208748852448309…81539885092817469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.291 × 10⁹⁸(99-digit number)
12919441749770489661…63079770185634938881
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,840,593 XPM·at block #6,824,565 · 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