Block #2,796,047

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/16/2018, 4:00:04 AM · Difficulty 11.6817 · 4,040,416 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6d364f1f4b3481703bfcf5fca4ca4dc9c7912dab8b6769342be4313311fdeedb

Height

#2,796,047

Difficulty

11.681683

Transactions

17

Size

5.66 KB

Version

2

Bits

0bae82c0

Nonce

42,170,119

Timestamp

8/16/2018, 4:00:04 AM

Confirmations

4,040,416

Merkle Root

6f762ba7a17ff64fce695a92a7d415aeb529608135cab655a291587fbe6b0054
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.

2.801 × 10⁹⁵(96-digit number)
28010975118632663263…20171586530549204479
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
2.801 × 10⁹⁵(96-digit number)
28010975118632663263…20171586530549204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.602 × 10⁹⁵(96-digit number)
56021950237265326527…40343173061098408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.120 × 10⁹⁶(97-digit number)
11204390047453065305…80686346122196817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.240 × 10⁹⁶(97-digit number)
22408780094906130611…61372692244393635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.481 × 10⁹⁶(97-digit number)
44817560189812261222…22745384488787271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.963 × 10⁹⁶(97-digit number)
89635120379624522444…45490768977574543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.792 × 10⁹⁷(98-digit number)
17927024075924904488…90981537955149086719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.585 × 10⁹⁷(98-digit number)
35854048151849808977…81963075910298173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.170 × 10⁹⁷(98-digit number)
71708096303699617955…63926151820596346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.434 × 10⁹⁸(99-digit number)
14341619260739923591…27852303641192693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.868 × 10⁹⁸(99-digit number)
28683238521479847182…55704607282385387519
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,935,976 XPM·at block #6,836,462 · 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