Block #2,805,747

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/23/2018, 1:02:01 AM · Difficulty 11.6690 · 4,038,679 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83ad340c56f578ab08fae76fbe9f9ab9634c1365eb50377301fe4b30f2449374

Height

#2,805,747

Difficulty

11.669027

Transactions

3

Size

1.22 KB

Version

2

Bits

0bab4555

Nonce

1,704,396,521

Timestamp

8/23/2018, 1:02:01 AM

Confirmations

4,038,679

Merkle Root

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

4.006 × 10⁹⁴(95-digit number)
40069001345613151569…14160890640405855999
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
4.006 × 10⁹⁴(95-digit number)
40069001345613151569…14160890640405855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.013 × 10⁹⁴(95-digit number)
80138002691226303138…28321781280811711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.602 × 10⁹⁵(96-digit number)
16027600538245260627…56643562561623423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.205 × 10⁹⁵(96-digit number)
32055201076490521255…13287125123246847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.411 × 10⁹⁵(96-digit number)
64110402152981042511…26574250246493695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.282 × 10⁹⁶(97-digit number)
12822080430596208502…53148500492987391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.564 × 10⁹⁶(97-digit number)
25644160861192417004…06297000985974783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.128 × 10⁹⁶(97-digit number)
51288321722384834008…12594001971949567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.025 × 10⁹⁷(98-digit number)
10257664344476966801…25188003943899135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.051 × 10⁹⁷(98-digit number)
20515328688953933603…50376007887798271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.103 × 10⁹⁷(98-digit number)
41030657377907867207…00752015775596543999
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,999,804 XPM·at block #6,844,425 · 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