1. #6,810,9312CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #270,098

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/23/2013, 5:00:02 PM · Difficulty 9.9518 · 6,540,834 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a2f4e2582a3b0baffba8c14eb0bf30a2b8e752f784f75faedc55f2f316b5b72d

Height

#270,098

Difficulty

9.951850

Transactions

8

Size

3.45 KB

Version

2

Bits

09f3ac6d

Nonce

553

Timestamp

11/23/2013, 5:00:02 PM

Confirmations

6,540,834

Merkle Root

1a197aa1c420b7afda42ecd0acedf8a82dace234735aef0660d18550b1c1c6d7
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.242 × 10⁹³(94-digit number)
22421706421487511379…99142771084383795201
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.242 × 10⁹³(94-digit number)
22421706421487511379…99142771084383795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.484 × 10⁹³(94-digit number)
44843412842975022758…98285542168767590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.968 × 10⁹³(94-digit number)
89686825685950045517…96571084337535180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.793 × 10⁹⁴(95-digit number)
17937365137190009103…93142168675070361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.587 × 10⁹⁴(95-digit number)
35874730274380018207…86284337350140723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.174 × 10⁹⁴(95-digit number)
71749460548760036414…72568674700281446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.434 × 10⁹⁵(96-digit number)
14349892109752007282…45137349400562892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.869 × 10⁹⁵(96-digit number)
28699784219504014565…90274698801125785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.739 × 10⁹⁵(96-digit number)
57399568439008029131…80549397602251571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.147 × 10⁹⁶(97-digit number)
11479913687801605826…61098795204503142401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,731,559 XPM·at block #6,810,931 · 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