Block #2,283,099

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2017, 5:30:54 AM · Difficulty 10.9557 · 4,559,448 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5f0371e89d4befffa64c7424e4b6e712327f4680b6fa9694642991860164808

Height

#2,283,099

Difficulty

10.955653

Transactions

11

Size

2.69 KB

Version

2

Bits

0af4a5ab

Nonce

148,211,750

Timestamp

9/5/2017, 5:30:54 AM

Confirmations

4,559,448

Merkle Root

069b0b943cdf752514d12aeea735bde640913a8d3425b0db102ec81e8f370648
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.

6.197 × 10⁹⁵(96-digit number)
61973871098428562037…60343163499394073599
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
6.197 × 10⁹⁵(96-digit number)
61973871098428562037…60343163499394073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.239 × 10⁹⁶(97-digit number)
12394774219685712407…20686326998788147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.478 × 10⁹⁶(97-digit number)
24789548439371424814…41372653997576294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.957 × 10⁹⁶(97-digit number)
49579096878742849629…82745307995152588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.915 × 10⁹⁶(97-digit number)
99158193757485699259…65490615990305177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.983 × 10⁹⁷(98-digit number)
19831638751497139851…30981231980610355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.966 × 10⁹⁷(98-digit number)
39663277502994279703…61962463961220710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.932 × 10⁹⁷(98-digit number)
79326555005988559407…23924927922441420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.586 × 10⁹⁸(99-digit number)
15865311001197711881…47849855844882841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.173 × 10⁹⁸(99-digit number)
31730622002395423762…95699711689765683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.346 × 10⁹⁸(99-digit number)
63461244004790847525…91399423379531366399
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,984,801 XPM·at block #6,842,546 · 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