Block #2,088,596

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/26/2017, 11:09:48 AM · Difficulty 10.8752 · 4,743,519 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
33869d2f9a841340f79210be001646741291af2fd51a5363adc717be1db501c9

Height

#2,088,596

Difficulty

10.875226

Transactions

2

Size

1.14 KB

Version

2

Bits

0ae00ed7

Nonce

49,113,365

Timestamp

4/26/2017, 11:09:48 AM

Confirmations

4,743,519

Merkle Root

85a35bb6c49bb7219c6b10f7d60e6bfa51c5d993836731975031ee7d37952e6e
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.

1.047 × 10⁹⁴(95-digit number)
10474715406705296683…16900621320439918129
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
1.047 × 10⁹⁴(95-digit number)
10474715406705296683…16900621320439918129
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.094 × 10⁹⁴(95-digit number)
20949430813410593366…33801242640879836259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.189 × 10⁹⁴(95-digit number)
41898861626821186733…67602485281759672519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.379 × 10⁹⁴(95-digit number)
83797723253642373467…35204970563519345039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.675 × 10⁹⁵(96-digit number)
16759544650728474693…70409941127038690079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.351 × 10⁹⁵(96-digit number)
33519089301456949387…40819882254077380159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.703 × 10⁹⁵(96-digit number)
67038178602913898774…81639764508154760319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.340 × 10⁹⁶(97-digit number)
13407635720582779754…63279529016309520639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.681 × 10⁹⁶(97-digit number)
26815271441165559509…26559058032619041279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.363 × 10⁹⁶(97-digit number)
53630542882331119019…53118116065238082559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.072 × 10⁹⁷(98-digit number)
10726108576466223803…06236232130476165119
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,901,052 XPM·at block #6,832,114 · 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