Block #2,731,163

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/2/2018, 2:22:27 PM · Difficulty 11.6315 · 4,102,784 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b404c8b2750bff57e73909ae6db8eca9206c22877defc9d1375554295e469dd

Height

#2,731,163

Difficulty

11.631475

Transactions

8

Size

2.32 KB

Version

2

Bits

0ba1a852

Nonce

561,257,161

Timestamp

7/2/2018, 2:22:27 PM

Confirmations

4,102,784

Merkle Root

6d3ac511b350313d0b140454cc8d30526ad489d7886c93e9e313f7f51fcae1cf
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.146 × 10⁹⁶(97-digit number)
11463557557841694767…00013513796218751999
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.146 × 10⁹⁶(97-digit number)
11463557557841694767…00013513796218751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.292 × 10⁹⁶(97-digit number)
22927115115683389534…00027027592437503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.585 × 10⁹⁶(97-digit number)
45854230231366779069…00054055184875007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.170 × 10⁹⁶(97-digit number)
91708460462733558139…00108110369750015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.834 × 10⁹⁷(98-digit number)
18341692092546711627…00216220739500031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.668 × 10⁹⁷(98-digit number)
36683384185093423255…00432441479000063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.336 × 10⁹⁷(98-digit number)
73366768370186846511…00864882958000127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.467 × 10⁹⁸(99-digit number)
14673353674037369302…01729765916000255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.934 × 10⁹⁸(99-digit number)
29346707348074738604…03459531832000511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.869 × 10⁹⁸(99-digit number)
58693414696149477209…06919063664001023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.173 × 10⁹⁹(100-digit number)
11738682939229895441…13838127328002047999
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,915,804 XPM·at block #6,833,946 · 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