Block #2,781,992

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/6/2018, 5:08:47 PM · Difficulty 11.6519 · 4,059,794 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6b4610921fec54f3356d22951373bbc369c9c3b49c312f90b541425c3fc425c0

Height

#2,781,992

Difficulty

11.651897

Transactions

30

Size

7.09 KB

Version

2

Bits

0ba6e2b1

Nonce

89,057,735

Timestamp

8/6/2018, 5:08:47 PM

Confirmations

4,059,794

Merkle Root

a162c4f438a2e4aeb7136b6eb7132e2d1dff571d666c54f7bef2f646fd0714b0
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.667 × 10⁹⁴(95-digit number)
26679240542980050357…96685259044833406079
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.667 × 10⁹⁴(95-digit number)
26679240542980050357…96685259044833406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.335 × 10⁹⁴(95-digit number)
53358481085960100715…93370518089666812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.067 × 10⁹⁵(96-digit number)
10671696217192020143…86741036179333624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.134 × 10⁹⁵(96-digit number)
21343392434384040286…73482072358667248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.268 × 10⁹⁵(96-digit number)
42686784868768080572…46964144717334497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.537 × 10⁹⁵(96-digit number)
85373569737536161144…93928289434668994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.707 × 10⁹⁶(97-digit number)
17074713947507232228…87856578869337989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.414 × 10⁹⁶(97-digit number)
34149427895014464457…75713157738675978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.829 × 10⁹⁶(97-digit number)
68298855790028928915…51426315477351956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.365 × 10⁹⁷(98-digit number)
13659771158005785783…02852630954703912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.731 × 10⁹⁷(98-digit number)
27319542316011571566…05705261909407825919
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,978,666 XPM·at block #6,841,785 · 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