1. #6,810,3501CC13 primes

    Cunningham 1st · ⛏️ coinsforall.io

  2. #6,810,349TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #289,574

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 6:45:32 AM · Difficulty 9.9886 · 6,520,777 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c2166fab0dfbb1e328af7d8cba5d9e2e1b5033f9003fe6465620dfa565fffc3e

Height

#289,574

Difficulty

9.988619

Transactions

16

Size

7.09 KB

Version

2

Bits

09fd1621

Nonce

58,597

Timestamp

12/2/2013, 6:45:32 AM

Confirmations

6,520,777

Merkle Root

b55c68a888d3deb1e7c871d675d2eca2e6e7a6046c3ce257d0a54fe768cdf019
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.534 × 10⁹⁷(98-digit number)
15340147754582159119…54713192974198210561
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.534 × 10⁹⁷(98-digit number)
15340147754582159119…54713192974198210561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.068 × 10⁹⁷(98-digit number)
30680295509164318239…09426385948396421121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.136 × 10⁹⁷(98-digit number)
61360591018328636478…18852771896792842241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.227 × 10⁹⁸(99-digit number)
12272118203665727295…37705543793585684481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.454 × 10⁹⁸(99-digit number)
24544236407331454591…75411087587171368961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.908 × 10⁹⁸(99-digit number)
49088472814662909182…50822175174342737921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.817 × 10⁹⁸(99-digit number)
98176945629325818365…01644350348685475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.963 × 10⁹⁹(100-digit number)
19635389125865163673…03288700697370951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.927 × 10⁹⁹(100-digit number)
39270778251730327346…06577401394741903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.854 × 10⁹⁹(100-digit number)
78541556503460654692…13154802789483806721
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,726,889 XPM·at block #6,810,350 · 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