Block #2,853,335

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/24/2018, 1:42:26 PM · Difficulty 11.7162 · 3,988,830 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
004991aa734bbdf580b1dce03288c06c38f18a23042dcf1c224ae976e8f8b0b4

Height

#2,853,335

Difficulty

11.716179

Transactions

2

Size

722 B

Version

2

Bits

0bb75783

Nonce

133,480,947

Timestamp

9/24/2018, 1:42:26 PM

Confirmations

3,988,830

Merkle Root

8c7a26135c1c0d0be3ae69566f3084684a8066093f7d830245dc3d7e5b6f7e5e
Transactions (2)
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.

1.371 × 10⁹⁸(99-digit number)
13719469029480820229…51088203170678548479
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
1.371 × 10⁹⁸(99-digit number)
13719469029480820229…51088203170678548479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.743 × 10⁹⁸(99-digit number)
27438938058961640458…02176406341357096959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.487 × 10⁹⁸(99-digit number)
54877876117923280916…04352812682714193919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.097 × 10⁹⁹(100-digit number)
10975575223584656183…08705625365428387839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.195 × 10⁹⁹(100-digit number)
21951150447169312366…17411250730856775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.390 × 10⁹⁹(100-digit number)
43902300894338624733…34822501461713551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.780 × 10⁹⁹(100-digit number)
87804601788677249466…69645002923427102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.756 × 10¹⁰⁰(101-digit number)
17560920357735449893…39290005846854205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.512 × 10¹⁰⁰(101-digit number)
35121840715470899786…78580011693708410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.024 × 10¹⁰⁰(101-digit number)
70243681430941799573…57160023387416821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.404 × 10¹⁰¹(102-digit number)
14048736286188359914…14320046774833643519
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,981,711 XPM·at block #6,842,164 · 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