Block #2,775,274

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/1/2018, 9:46:03 PM · Difficulty 11.6656 · 4,034,224 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
666dce534ba91bd6fab4815a80eafceb42d6741c4c20ad0a99a06809c770a493

Height

#2,775,274

Difficulty

11.665644

Transactions

6

Size

2.11 KB

Version

2

Bits

0baa679e

Nonce

1,140,710,512

Timestamp

8/1/2018, 9:46:03 PM

Confirmations

4,034,224

Merkle Root

d6688102899f595e7cd0972cdb93ea1ed8cff0075e32b25130c37c874ec42586
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.124 × 10⁹⁶(97-digit number)
11242336789100675869…20459138390696673279
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.124 × 10⁹⁶(97-digit number)
11242336789100675869…20459138390696673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.248 × 10⁹⁶(97-digit number)
22484673578201351738…40918276781393346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.496 × 10⁹⁶(97-digit number)
44969347156402703477…81836553562786693119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.993 × 10⁹⁶(97-digit number)
89938694312805406954…63673107125573386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.798 × 10⁹⁷(98-digit number)
17987738862561081390…27346214251146772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.597 × 10⁹⁷(98-digit number)
35975477725122162781…54692428502293544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.195 × 10⁹⁷(98-digit number)
71950955450244325563…09384857004587089919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.439 × 10⁹⁸(99-digit number)
14390191090048865112…18769714009174179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.878 × 10⁹⁸(99-digit number)
28780382180097730225…37539428018348359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.756 × 10⁹⁸(99-digit number)
57560764360195460450…75078856036696719359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.151 × 10⁹⁹(100-digit number)
11512152872039092090…50157712073393438719
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,720,057 XPM·at block #6,809,497 · 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.

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