Block #2,778,900

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2018, 2:11:00 PM · Difficulty 11.6494 · 4,063,629 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5b907874bef714def65a7d9d244234a16a12ab5b4d8f763da4ca4c8769a3ed82

Height

#2,778,900

Difficulty

11.649407

Transactions

34

Size

9.77 KB

Version

2

Bits

0ba63f88

Nonce

23,430,837

Timestamp

8/4/2018, 2:11:00 PM

Confirmations

4,063,629

Merkle Root

6410aa555a3d57cc51216c2c6da33e8a3ab8024913bac54022f373a1f4793d83
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.802 × 10⁹⁴(95-digit number)
18027769723453736463…49394576927880794639
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.802 × 10⁹⁴(95-digit number)
18027769723453736463…49394576927880794639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.605 × 10⁹⁴(95-digit number)
36055539446907472927…98789153855761589279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.211 × 10⁹⁴(95-digit number)
72111078893814945854…97578307711523178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.442 × 10⁹⁵(96-digit number)
14422215778762989170…95156615423046357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.884 × 10⁹⁵(96-digit number)
28844431557525978341…90313230846092714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.768 × 10⁹⁵(96-digit number)
57688863115051956683…80626461692185428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.153 × 10⁹⁶(97-digit number)
11537772623010391336…61252923384370856959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.307 × 10⁹⁶(97-digit number)
23075545246020782673…22505846768741713919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.615 × 10⁹⁶(97-digit number)
46151090492041565347…45011693537483427839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.230 × 10⁹⁶(97-digit number)
92302180984083130694…90023387074966855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.846 × 10⁹⁷(98-digit number)
18460436196816626138…80046774149933711359
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,654 XPM·at block #6,842,528 · 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