Block #2,815,620

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/29/2018, 5:49:53 PM · Difficulty 11.6840 · 4,027,637 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
020d43d536778f72bddc070fbbdd699b7d78410b3494eb6463290fe6fd19b1ba

Height

#2,815,620

Difficulty

11.683966

Transactions

6

Size

1.34 KB

Version

2

Bits

0baf1860

Nonce

649,342,779

Timestamp

8/29/2018, 5:49:53 PM

Confirmations

4,027,637

Merkle Root

10e67db0ea50ad54f72592e2951201f5a661b918815d6beac0f10dfa417a3cf0
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.887 × 10⁹³(94-digit number)
38870442814814920132…51854338585552868239
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.887 × 10⁹³(94-digit number)
38870442814814920132…51854338585552868239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.774 × 10⁹³(94-digit number)
77740885629629840264…03708677171105736479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.554 × 10⁹⁴(95-digit number)
15548177125925968052…07417354342211472959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.109 × 10⁹⁴(95-digit number)
31096354251851936105…14834708684422945919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.219 × 10⁹⁴(95-digit number)
62192708503703872211…29669417368845891839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.243 × 10⁹⁵(96-digit number)
12438541700740774442…59338834737691783679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.487 × 10⁹⁵(96-digit number)
24877083401481548884…18677669475383567359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.975 × 10⁹⁵(96-digit number)
49754166802963097769…37355338950767134719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.950 × 10⁹⁵(96-digit number)
99508333605926195538…74710677901534269439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.990 × 10⁹⁶(97-digit number)
19901666721185239107…49421355803068538879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.980 × 10⁹⁶(97-digit number)
39803333442370478215…98842711606137077759
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,990,428 XPM·at block #6,843,256 · 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