1. #6,808,699TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #312,474

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 1:02:43 AM · Difficulty 9.9958 · 6,496,226 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
28e2887b80ce47517aac4fe06563e5e5baefee9892bd70640d2c0bf10db1cfd1

Height

#312,474

Difficulty

9.995824

Transactions

1

Size

1.15 KB

Version

2

Bits

09feee52

Nonce

1,959

Timestamp

12/15/2013, 1:02:43 AM

Confirmations

6,496,226

Merkle Root

ccf86bc6bf13f62a2dbba7f162a7a21ce5982addf86241777f539ffb32ead435
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.639 × 10⁹⁶(97-digit number)
16393762722540684771…30921200313246095361
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.639 × 10⁹⁶(97-digit number)
16393762722540684771…30921200313246095361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.278 × 10⁹⁶(97-digit number)
32787525445081369543…61842400626492190721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.557 × 10⁹⁶(97-digit number)
65575050890162739086…23684801252984381441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.311 × 10⁹⁷(98-digit number)
13115010178032547817…47369602505968762881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.623 × 10⁹⁷(98-digit number)
26230020356065095634…94739205011937525761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.246 × 10⁹⁷(98-digit number)
52460040712130191269…89478410023875051521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.049 × 10⁹⁸(99-digit number)
10492008142426038253…78956820047750103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.098 × 10⁹⁸(99-digit number)
20984016284852076507…57913640095500206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.196 × 10⁹⁸(99-digit number)
41968032569704153015…15827280191000412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.393 × 10⁹⁸(99-digit number)
83936065139408306030…31654560382000824321
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,713,650 XPM·at block #6,808,699 · 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