Block #2,681,991

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2018, 7:42:44 PM · Difficulty 11.6908 · 4,155,672 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a654881bfc958fc2308ad2b2d5eb9e52b9bcd0e4cab49d69b95231a306ec082

Height

#2,681,991

Difficulty

11.690815

Transactions

6

Size

2.92 KB

Version

2

Bits

0bb0d942

Nonce

2,118,235,441

Timestamp

5/28/2018, 7:42:44 PM

Confirmations

4,155,672

Merkle Root

37c5c3675634737812913178bea146c2deef04532f294b817b9a546baa40d792
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.

6.532 × 10⁹⁴(95-digit number)
65325807183920816586…26837469837186416771
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
6.532 × 10⁹⁴(95-digit number)
65325807183920816586…26837469837186416771
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.306 × 10⁹⁵(96-digit number)
13065161436784163317…53674939674372833541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.613 × 10⁹⁵(96-digit number)
26130322873568326634…07349879348745667081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.226 × 10⁹⁵(96-digit number)
52260645747136653269…14699758697491334161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.045 × 10⁹⁶(97-digit number)
10452129149427330653…29399517394982668321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.090 × 10⁹⁶(97-digit number)
20904258298854661307…58799034789965336641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.180 × 10⁹⁶(97-digit number)
41808516597709322615…17598069579930673281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.361 × 10⁹⁶(97-digit number)
83617033195418645230…35196139159861346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.672 × 10⁹⁷(98-digit number)
16723406639083729046…70392278319722693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.344 × 10⁹⁷(98-digit number)
33446813278167458092…40784556639445386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.689 × 10⁹⁷(98-digit number)
66893626556334916184…81569113278890772481
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,945,627 XPM·at block #6,837,662 · 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