Block #2,886,215

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/18/2018, 9:32:14 AM · Difficulty 11.6248 · 3,952,997 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b9e8383e4ad962b8493e17e7a519f7e25437a2d514d1c1b18aba056a9dc8a5fa

Height

#2,886,215

Difficulty

11.624808

Transactions

10

Size

5.75 KB

Version

2

Bits

0b9ff363

Nonce

390,960,777

Timestamp

10/18/2018, 9:32:14 AM

Confirmations

3,952,997

Merkle Root

13bc774e997f4ffc8d3c4c1c871738d7ba6203b5b60e490f272603828c207b72
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.

3.950 × 10⁹²(93-digit number)
39503970079395894055…49180551203968029399
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
3.950 × 10⁹²(93-digit number)
39503970079395894055…49180551203968029399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.900 × 10⁹²(93-digit number)
79007940158791788110…98361102407936058799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.580 × 10⁹³(94-digit number)
15801588031758357622…96722204815872117599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.160 × 10⁹³(94-digit number)
31603176063516715244…93444409631744235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.320 × 10⁹³(94-digit number)
63206352127033430488…86888819263488470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.264 × 10⁹⁴(95-digit number)
12641270425406686097…73777638526976940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.528 × 10⁹⁴(95-digit number)
25282540850813372195…47555277053953881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.056 × 10⁹⁴(95-digit number)
50565081701626744390…95110554107907763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.011 × 10⁹⁵(96-digit number)
10113016340325348878…90221108215815526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.022 × 10⁹⁵(96-digit number)
20226032680650697756…80442216431631052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.045 × 10⁹⁵(96-digit number)
40452065361301395512…60884432863262105599
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,957,978 XPM·at block #6,839,211 · 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