1. #6,808,2202CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #666,989

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2014, 9:45:23 AM · Difficulty 10.9619 · 6,141,232 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5717744fee7749e4e5b3f403bbc1cd1228e9d46434c904499f54ee936ff540aa

Height

#666,989

Difficulty

10.961878

Transactions

6

Size

1.31 KB

Version

2

Bits

0af63da8

Nonce

111,992,856

Timestamp

8/7/2014, 9:45:23 AM

Confirmations

6,141,232

Merkle Root

bc0abe6ae7d8dc3e224313ac0154121be79dcf199cecf422e54c1bf1ff8b0959
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.504 × 10⁹⁴(95-digit number)
15044679743913075711…66849054052734582131
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.504 × 10⁹⁴(95-digit number)
15044679743913075711…66849054052734582131
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.008 × 10⁹⁴(95-digit number)
30089359487826151423…33698108105469164261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.017 × 10⁹⁴(95-digit number)
60178718975652302847…67396216210938328521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.203 × 10⁹⁵(96-digit number)
12035743795130460569…34792432421876657041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.407 × 10⁹⁵(96-digit number)
24071487590260921138…69584864843753314081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.814 × 10⁹⁵(96-digit number)
48142975180521842277…39169729687506628161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.628 × 10⁹⁵(96-digit number)
96285950361043684555…78339459375013256321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.925 × 10⁹⁶(97-digit number)
19257190072208736911…56678918750026512641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.851 × 10⁹⁶(97-digit number)
38514380144417473822…13357837500053025281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.702 × 10⁹⁶(97-digit number)
77028760288834947644…26715675000106050561
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,709,819 XPM·at block #6,808,220 · 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