Block #1,852,005

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2016, 6:53:53 PM · Difficulty 10.6328 · 4,993,235 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c71b026f7bb0b842b1165a86f4c07566620663e349c363c498924573ed05ee90

Height

#1,852,005

Difficulty

10.632762

Transactions

3

Size

2.70 KB

Version

2

Bits

0aa1fcb6

Nonce

520,260,437

Timestamp

11/16/2016, 6:53:53 PM

Confirmations

4,993,235

Merkle Root

1e0c88d2596b1659981ae2b8af6ad47a4168d497279e95c605848c04f533d766
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.047 × 10⁹⁴(95-digit number)
20475281969338070474…95891523978492415401
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.047 × 10⁹⁴(95-digit number)
20475281969338070474…95891523978492415401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.095 × 10⁹⁴(95-digit number)
40950563938676140949…91783047956984830801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.190 × 10⁹⁴(95-digit number)
81901127877352281899…83566095913969661601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.638 × 10⁹⁵(96-digit number)
16380225575470456379…67132191827939323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.276 × 10⁹⁵(96-digit number)
32760451150940912759…34264383655878646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.552 × 10⁹⁵(96-digit number)
65520902301881825519…68528767311757292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.310 × 10⁹⁶(97-digit number)
13104180460376365103…37057534623514585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.620 × 10⁹⁶(97-digit number)
26208360920752730207…74115069247029171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.241 × 10⁹⁶(97-digit number)
52416721841505460415…48230138494058342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10483344368301092083…96460276988116684801
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:58,006,352 XPM·at block #6,845,239 · 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