1. #6,809,0572CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #305,625

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 2:46:10 PM · Difficulty 9.9936 · 6,503,433 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b8291d33d79fff74153bdb4ff64604c22400cba285b9306186722abe4a124ee

Height

#305,625

Difficulty

9.993633

Transactions

2

Size

1.23 KB

Version

2

Bits

09fe5ebd

Nonce

61

Timestamp

12/11/2013, 2:46:10 PM

Confirmations

6,503,433

Merkle Root

25f3a4f795e05d32427674734868534ec368be042d3da2c8aeb599e4032059d4
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.427 × 10⁹³(94-digit number)
14273080172995231051…65935760236020083201
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.427 × 10⁹³(94-digit number)
14273080172995231051…65935760236020083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.854 × 10⁹³(94-digit number)
28546160345990462103…31871520472040166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.709 × 10⁹³(94-digit number)
57092320691980924207…63743040944080332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.141 × 10⁹⁴(95-digit number)
11418464138396184841…27486081888160665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.283 × 10⁹⁴(95-digit number)
22836928276792369683…54972163776321331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.567 × 10⁹⁴(95-digit number)
45673856553584739366…09944327552642662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.134 × 10⁹⁴(95-digit number)
91347713107169478732…19888655105285324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.826 × 10⁹⁵(96-digit number)
18269542621433895746…39777310210570649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.653 × 10⁹⁵(96-digit number)
36539085242867791492…79554620421141299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.307 × 10⁹⁵(96-digit number)
73078170485735582985…59109240842282598401
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,716,530 XPM·at block #6,809,057 · 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