Block #2,689,001

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2018, 7:44:42 PM · Difficulty 11.6788 · 4,149,888 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ae5095d46b98206524ccd25f5dc59ccefdd51c88d15016e926c1bfa1d793761

Height

#2,689,001

Difficulty

11.678833

Transactions

3

Size

1.01 KB

Version

2

Bits

0badc7fb

Nonce

357,461,037

Timestamp

6/2/2018, 7:44:42 PM

Confirmations

4,149,888

Merkle Root

458a341abca66ba827fffe080fdaabce2f7df6cc3844d1635e0ad4ebd72b81d1
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.178 × 10⁹²(93-digit number)
51784156523792559054…99678179573650077499
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.178 × 10⁹²(93-digit number)
51784156523792559054…99678179573650077499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.035 × 10⁹³(94-digit number)
10356831304758511810…99356359147300154999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.071 × 10⁹³(94-digit number)
20713662609517023621…98712718294600309999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.142 × 10⁹³(94-digit number)
41427325219034047243…97425436589200619999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.285 × 10⁹³(94-digit number)
82854650438068094486…94850873178401239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.657 × 10⁹⁴(95-digit number)
16570930087613618897…89701746356802479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.314 × 10⁹⁴(95-digit number)
33141860175227237794…79403492713604959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.628 × 10⁹⁴(95-digit number)
66283720350454475589…58806985427209919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.325 × 10⁹⁵(96-digit number)
13256744070090895117…17613970854419839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.651 × 10⁹⁵(96-digit number)
26513488140181790235…35227941708839679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.302 × 10⁹⁵(96-digit number)
53026976280363580471…70455883417679359999
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,955,382 XPM·at block #6,838,888 · 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