Block #2,815,735

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/29/2018, 7:35:14 PM · Difficulty 11.6844 · 4,026,736 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea68083e3b668e2f27fe87dda5c101087a83154a47ef1ff4072f1c2d194e7570

Height

#2,815,735

Difficulty

11.684394

Transactions

20

Size

4.54 KB

Version

2

Bits

0baf3474

Nonce

117,479,227

Timestamp

8/29/2018, 7:35:14 PM

Confirmations

4,026,736

Merkle Root

52bd0ebaa9a95c7df3d5727872fa64baf1da3a60b5bbd08894c93c8052cebdab
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.136 × 10⁹³(94-digit number)
31363416589784107141…73112928095346084919
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.136 × 10⁹³(94-digit number)
31363416589784107141…73112928095346084919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.272 × 10⁹³(94-digit number)
62726833179568214282…46225856190692169839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.254 × 10⁹⁴(95-digit number)
12545366635913642856…92451712381384339679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.509 × 10⁹⁴(95-digit number)
25090733271827285713…84903424762768679359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.018 × 10⁹⁴(95-digit number)
50181466543654571426…69806849525537358719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.003 × 10⁹⁵(96-digit number)
10036293308730914285…39613699051074717439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.007 × 10⁹⁵(96-digit number)
20072586617461828570…79227398102149434879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.014 × 10⁹⁵(96-digit number)
40145173234923657141…58454796204298869759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.029 × 10⁹⁵(96-digit number)
80290346469847314282…16909592408597739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.605 × 10⁹⁶(97-digit number)
16058069293969462856…33819184817195479039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.211 × 10⁹⁶(97-digit number)
32116138587938925712…67638369634390958079
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,984,186 XPM·at block #6,842,470 · 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