Block #2,814,315

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/28/2018, 8:43:47 PM · Difficulty 11.6814 · 4,025,244 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7ddc6b41c6e12d5d11c369efa8e5d58adb05d7c42fbc6a7049fdb688536dcb15

Height

#2,814,315

Difficulty

11.681421

Transactions

41

Size

11.35 KB

Version

2

Bits

0bae7196

Nonce

522,943,961

Timestamp

8/28/2018, 8:43:47 PM

Confirmations

4,025,244

Merkle Root

f6673abf521876aa81779b307397bb7876d2cc974b031d2e2fbdd0da2a453916
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.904 × 10⁹³(94-digit number)
29041181305603049964…63199572714280149849
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.904 × 10⁹³(94-digit number)
29041181305603049964…63199572714280149849
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.808 × 10⁹³(94-digit number)
58082362611206099928…26399145428560299699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.161 × 10⁹⁴(95-digit number)
11616472522241219985…52798290857120599399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.323 × 10⁹⁴(95-digit number)
23232945044482439971…05596581714241198799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.646 × 10⁹⁴(95-digit number)
46465890088964879942…11193163428482397599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.293 × 10⁹⁴(95-digit number)
92931780177929759885…22386326856964795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.858 × 10⁹⁵(96-digit number)
18586356035585951977…44772653713929590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.717 × 10⁹⁵(96-digit number)
37172712071171903954…89545307427859180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.434 × 10⁹⁵(96-digit number)
74345424142343807908…79090614855718361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.486 × 10⁹⁶(97-digit number)
14869084828468761581…58181229711436723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.973 × 10⁹⁶(97-digit number)
29738169656937523163…16362459422873446399
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,960,755 XPM·at block #6,839,558 · 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