1. #6,807,7151CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #282,473

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 9:46:48 AM · Difficulty 9.9792 · 6,525,243 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad46c8084eacca65fc954acc8738d9e80c8ee896f8ed2b0f3695526552d67afb

Height

#282,473

Difficulty

9.979197

Transactions

13

Size

4.78 KB

Version

2

Bits

09faaca2

Nonce

97,152

Timestamp

11/29/2013, 9:46:48 AM

Confirmations

6,525,243

Merkle Root

99a613216ff8810340d63d89d2c46b361d209daa0193118ce731065c881cd41f
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.

4.957 × 10⁹²(93-digit number)
49573849406532578445…47923903636339589921
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
4.957 × 10⁹²(93-digit number)
49573849406532578445…47923903636339589921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.914 × 10⁹²(93-digit number)
99147698813065156891…95847807272679179841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.982 × 10⁹³(94-digit number)
19829539762613031378…91695614545358359681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.965 × 10⁹³(94-digit number)
39659079525226062756…83391229090716719361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.931 × 10⁹³(94-digit number)
79318159050452125512…66782458181433438721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.586 × 10⁹⁴(95-digit number)
15863631810090425102…33564916362866877441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.172 × 10⁹⁴(95-digit number)
31727263620180850205…67129832725733754881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.345 × 10⁹⁴(95-digit number)
63454527240361700410…34259665451467509761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.269 × 10⁹⁵(96-digit number)
12690905448072340082…68519330902935019521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.538 × 10⁹⁵(96-digit number)
25381810896144680164…37038661805870039041
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,705,761 XPM·at block #6,807,715 · 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