Block #2,833,343

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/10/2018, 4:32:17 PM · Difficulty 11.7155 · 4,011,914 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b71c14407e251fd07b67bb24bc0eb2ef6f7a3482405bd8cce7104d227e092a7d

Height

#2,833,343

Difficulty

11.715496

Transactions

17

Size

4.29 KB

Version

2

Bits

0bb72abd

Nonce

219,588,351

Timestamp

9/10/2018, 4:32:17 PM

Confirmations

4,011,914

Merkle Root

bfb568957cd143d3174df6f30730c1e113efc32a534137909f427a87909e0f1b
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.211 × 10⁹⁷(98-digit number)
42110289062513106017…66096193943782584319
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.211 × 10⁹⁷(98-digit number)
42110289062513106017…66096193943782584319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.422 × 10⁹⁷(98-digit number)
84220578125026212035…32192387887565168639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.684 × 10⁹⁸(99-digit number)
16844115625005242407…64384775775130337279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.368 × 10⁹⁸(99-digit number)
33688231250010484814…28769551550260674559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.737 × 10⁹⁸(99-digit number)
67376462500020969628…57539103100521349119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.347 × 10⁹⁹(100-digit number)
13475292500004193925…15078206201042698239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.695 × 10⁹⁹(100-digit number)
26950585000008387851…30156412402085396479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.390 × 10⁹⁹(100-digit number)
53901170000016775702…60312824804170792959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.078 × 10¹⁰⁰(101-digit number)
10780234000003355140…20625649608341585919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.156 × 10¹⁰⁰(101-digit number)
21560468000006710281…41251299216683171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.312 × 10¹⁰⁰(101-digit number)
43120936000013420562…82502598433366343679
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:58,006,489 XPM·at block #6,845,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