Block #2,817,908

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/31/2018, 4:36:26 AM · Difficulty 11.6963 · 4,019,849 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ed85657b6e0a38b3edce00875ced5ab0b7a5514bd7561116183803e687e36c81

Height

#2,817,908

Difficulty

11.696346

Transactions

40

Size

11.92 KB

Version

2

Bits

0bb243b4

Nonce

674,684,447

Timestamp

8/31/2018, 4:36:26 AM

Confirmations

4,019,849

Merkle Root

5638cde57ae423b3ea9fc517f5802783e5c013b66d423e3a2ef66b2ae3d5215e
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.169 × 10⁹⁶(97-digit number)
11690965355855484883…40024756130407831039
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.169 × 10⁹⁶(97-digit number)
11690965355855484883…40024756130407831039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.338 × 10⁹⁶(97-digit number)
23381930711710969766…80049512260815662079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.676 × 10⁹⁶(97-digit number)
46763861423421939532…60099024521631324159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.352 × 10⁹⁶(97-digit number)
93527722846843879064…20198049043262648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.870 × 10⁹⁷(98-digit number)
18705544569368775812…40396098086525296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.741 × 10⁹⁷(98-digit number)
37411089138737551625…80792196173050593279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.482 × 10⁹⁷(98-digit number)
74822178277475103251…61584392346101186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.496 × 10⁹⁸(99-digit number)
14964435655495020650…23168784692202373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.992 × 10⁹⁸(99-digit number)
29928871310990041300…46337569384404746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.985 × 10⁹⁸(99-digit number)
59857742621980082601…92675138768809492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.197 × 10⁹⁹(100-digit number)
11971548524396016520…85350277537618984959
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,946,390 XPM·at block #6,837,756 · 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