Block #2,680,634

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2018, 8:22:29 PM · Difficulty 11.6934 · 4,159,941 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
649f8295f68930e78933d97db071e15e5b4fb20c2ad4135c6c837f69e04a2dda

Height

#2,680,634

Difficulty

11.693360

Transactions

2

Size

722 B

Version

2

Bits

0bb1800e

Nonce

86,498,160

Timestamp

5/27/2018, 8:22:29 PM

Confirmations

4,159,941

Merkle Root

03592eb4bf3b86c8d73335910c543900101bb2f5cdc4106d87da5ebdd17b4de6
Transactions (2)
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.947 × 10⁹⁶(97-digit number)
19470802204739660686…50536420894732387201
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.947 × 10⁹⁶(97-digit number)
19470802204739660686…50536420894732387201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.894 × 10⁹⁶(97-digit number)
38941604409479321373…01072841789464774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.788 × 10⁹⁶(97-digit number)
77883208818958642746…02145683578929548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.557 × 10⁹⁷(98-digit number)
15576641763791728549…04291367157859097601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.115 × 10⁹⁷(98-digit number)
31153283527583457098…08582734315718195201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.230 × 10⁹⁷(98-digit number)
62306567055166914197…17165468631436390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.246 × 10⁹⁸(99-digit number)
12461313411033382839…34330937262872780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.492 × 10⁹⁸(99-digit number)
24922626822066765678…68661874525745561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.984 × 10⁹⁸(99-digit number)
49845253644133531357…37323749051491123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.969 × 10⁹⁸(99-digit number)
99690507288267062715…74647498102982246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.993 × 10⁹⁹(100-digit number)
19938101457653412543…49294996205964492801
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:57,968,935 XPM·at block #6,840,574 · 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