Block #2,934,886

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/22/2018, 9:26:41 PM · Difficulty 11.3926 · 3,898,959 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f77ba0f161e071dd13f10e99b1f6c50206cac0aaf68d2d9abd100048b3e778c

Height

#2,934,886

Difficulty

11.392571

Transactions

13

Size

3.82 KB

Version

2

Bits

0b647f90

Nonce

910,445,442

Timestamp

11/22/2018, 9:26:41 PM

Confirmations

3,898,959

Merkle Root

b6e80cbcc42e5675a748e7926ddfdd866923ffd9a7cff50640564f9f79804c6d
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.713 × 10⁹⁴(95-digit number)
27131283179185605149…34800274050921454799
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.713 × 10⁹⁴(95-digit number)
27131283179185605149…34800274050921454799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.426 × 10⁹⁴(95-digit number)
54262566358371210298…69600548101842909599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.085 × 10⁹⁵(96-digit number)
10852513271674242059…39201096203685819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.170 × 10⁹⁵(96-digit number)
21705026543348484119…78402192407371638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.341 × 10⁹⁵(96-digit number)
43410053086696968238…56804384814743276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.682 × 10⁹⁵(96-digit number)
86820106173393936476…13608769629486553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.736 × 10⁹⁶(97-digit number)
17364021234678787295…27217539258973107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.472 × 10⁹⁶(97-digit number)
34728042469357574590…54435078517946214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.945 × 10⁹⁶(97-digit number)
69456084938715149181…08870157035892428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.389 × 10⁹⁷(98-digit number)
13891216987743029836…17740314071784857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.778 × 10⁹⁷(98-digit number)
27782433975486059672…35480628143569715199
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,914,990 XPM·at block #6,833,844 · 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