Block #2,825,759

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2018, 11:18:50 AM · Difficulty 11.7112 · 4,016,179 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
add94355339e8ecfdc6a6c6f9716aadedd778cf4912d9ef39eb5536c4e31c591

Height

#2,825,759

Difficulty

11.711168

Transactions

22

Size

8.60 KB

Version

2

Bits

0bb60f1c

Nonce

1,679,374,942

Timestamp

9/5/2018, 11:18:50 AM

Confirmations

4,016,179

Merkle Root

57662d6349ec0f43f75578b3506a284f2673baa784b187b4f6c50b3ae532983f
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.

4.587 × 10⁹⁴(95-digit number)
45874949315040332839…39529783623052296799
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
4.587 × 10⁹⁴(95-digit number)
45874949315040332839…39529783623052296799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.174 × 10⁹⁴(95-digit number)
91749898630080665678…79059567246104593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.834 × 10⁹⁵(96-digit number)
18349979726016133135…58119134492209187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.669 × 10⁹⁵(96-digit number)
36699959452032266271…16238268984418374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.339 × 10⁹⁵(96-digit number)
73399918904064532542…32476537968836748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.467 × 10⁹⁶(97-digit number)
14679983780812906508…64953075937673497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.935 × 10⁹⁶(97-digit number)
29359967561625813017…29906151875346995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.871 × 10⁹⁶(97-digit number)
58719935123251626034…59812303750693990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.174 × 10⁹⁷(98-digit number)
11743987024650325206…19624607501387980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.348 × 10⁹⁷(98-digit number)
23487974049300650413…39249215002775961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.697 × 10⁹⁷(98-digit number)
46975948098601300827…78498430005551923199
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,979,884 XPM·at block #6,841,937 · 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