Block #2,834,578

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/11/2018, 1:11:40 PM · Difficulty 11.7153 · 3,998,796 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1fd9bfd4f94ad35ce6a3ba96a0b3ef4561cfae4647a14004931b202bab8efa3d

Height

#2,834,578

Difficulty

11.715264

Transactions

3

Size

1.15 KB

Version

2

Bits

0bb71b85

Nonce

280,296,110

Timestamp

9/11/2018, 1:11:40 PM

Confirmations

3,998,796

Merkle Root

9284fa40aa1ce6e085d24a144eb001597089c4b02ee84318d06e6594ec5090ce
Transactions (3)
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.246 × 10⁹⁷(98-digit number)
42460448156530463527…87248375687238947839
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.246 × 10⁹⁷(98-digit number)
42460448156530463527…87248375687238947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.492 × 10⁹⁷(98-digit number)
84920896313060927055…74496751374477895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.698 × 10⁹⁸(99-digit number)
16984179262612185411…48993502748955791359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.396 × 10⁹⁸(99-digit number)
33968358525224370822…97987005497911582719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.793 × 10⁹⁸(99-digit number)
67936717050448741644…95974010995823165439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.358 × 10⁹⁹(100-digit number)
13587343410089748328…91948021991646330879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.717 × 10⁹⁹(100-digit number)
27174686820179496657…83896043983292661759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.434 × 10⁹⁹(100-digit number)
54349373640358993315…67792087966585323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.086 × 10¹⁰⁰(101-digit number)
10869874728071798663…35584175933170647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.173 × 10¹⁰⁰(101-digit number)
21739749456143597326…71168351866341294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.347 × 10¹⁰⁰(101-digit number)
43479498912287194652…42336703732682588159
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,911,188 XPM·at block #6,833,373 · 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