Block #2,776,100

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/2/2018, 1:17:13 PM · Difficulty 11.6585 · 4,068,907 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6353a400db4f39df07bcce75f32877f4a499a28df2482854c72454913a7a4629

Height

#2,776,100

Difficulty

11.658472

Transactions

30

Size

8.06 KB

Version

2

Bits

0ba891a3

Nonce

1,431,252,670

Timestamp

8/2/2018, 1:17:13 PM

Confirmations

4,068,907

Merkle Root

362b5f18e69d582441862e7b28f692b8236f0db15d067b3c153e63408da35656
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.300 × 10⁹⁴(95-digit number)
13000996475912660820…60245675207062314251
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.300 × 10⁹⁴(95-digit number)
13000996475912660820…60245675207062314251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.600 × 10⁹⁴(95-digit number)
26001992951825321641…20491350414124628501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.200 × 10⁹⁴(95-digit number)
52003985903650643282…40982700828249257001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.040 × 10⁹⁵(96-digit number)
10400797180730128656…81965401656498514001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.080 × 10⁹⁵(96-digit number)
20801594361460257312…63930803312997028001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.160 × 10⁹⁵(96-digit number)
41603188722920514625…27861606625994056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.320 × 10⁹⁵(96-digit number)
83206377445841029251…55723213251988112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.664 × 10⁹⁶(97-digit number)
16641275489168205850…11446426503976224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.328 × 10⁹⁶(97-digit number)
33282550978336411700…22892853007952448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.656 × 10⁹⁶(97-digit number)
66565101956672823401…45785706015904896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.331 × 10⁹⁷(98-digit number)
13313020391334564680…91571412031809792001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:58,004,477 XPM·at block #6,845,006 · 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