Block #2,914,559

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/8/2018, 6:58:40 AM · Difficulty 11.4707 · 3,929,344 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
81d4cc22f7677969665f8a59b89c40b7032effbbad43359ee8fd18bbf4d1091d

Height

#2,914,559

Difficulty

11.470736

Transactions

3

Size

1.36 KB

Version

2

Bits

0b78822d

Nonce

637,549,972

Timestamp

11/8/2018, 6:58:40 AM

Confirmations

3,929,344

Merkle Root

156cfac984230ccf2dc0b9d1d7095106125647bbbc801b62bcd673e05ee2db31
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.365 × 10⁹⁶(97-digit number)
23657150617309071021…80674205941375779839
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.365 × 10⁹⁶(97-digit number)
23657150617309071021…80674205941375779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.731 × 10⁹⁶(97-digit number)
47314301234618142043…61348411882751559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.462 × 10⁹⁶(97-digit number)
94628602469236284087…22696823765503119359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.892 × 10⁹⁷(98-digit number)
18925720493847256817…45393647531006238719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.785 × 10⁹⁷(98-digit number)
37851440987694513634…90787295062012477439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.570 × 10⁹⁷(98-digit number)
75702881975389027269…81574590124024954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.514 × 10⁹⁸(99-digit number)
15140576395077805453…63149180248049909759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.028 × 10⁹⁸(99-digit number)
30281152790155610907…26298360496099819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.056 × 10⁹⁸(99-digit number)
60562305580311221815…52596720992199639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.211 × 10⁹⁹(100-digit number)
12112461116062244363…05193441984399278079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.422 × 10⁹⁹(100-digit number)
24224922232124488726…10386883968798556159
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,995,595 XPM·at block #6,843,902 · 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