Block #667,677

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2014, 6:52:06 PM · Difficulty 10.9629 · 6,142,411 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e3c43f1a15966cfa6bf2a077e292543deea214528933e0a12c050e2183aa71c0

Height

#667,677

Difficulty

10.962942

Transactions

6

Size

1.88 KB

Version

5

Bits

0af68357

Nonce

1,316,844,635

Timestamp

8/7/2014, 6:52:06 PM

Confirmations

6,142,411

Merkle Root

af485ac3df2836cafdd92da31a4f4c6dedb032f43367b53091ea02537fd99e7e
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.005 × 10⁹³(94-digit number)
40053744505381633678…86646844631657778961
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.005 × 10⁹³(94-digit number)
40053744505381633678…86646844631657778961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.010 × 10⁹³(94-digit number)
80107489010763267356…73293689263315557921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.602 × 10⁹⁴(95-digit number)
16021497802152653471…46587378526631115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.204 × 10⁹⁴(95-digit number)
32042995604305306942…93174757053262231681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.408 × 10⁹⁴(95-digit number)
64085991208610613884…86349514106524463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.281 × 10⁹⁵(96-digit number)
12817198241722122776…72699028213048926721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.563 × 10⁹⁵(96-digit number)
25634396483444245553…45398056426097853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.126 × 10⁹⁵(96-digit number)
51268792966888491107…90796112852195706881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.025 × 10⁹⁶(97-digit number)
10253758593377698221…81592225704391413761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.050 × 10⁹⁶(97-digit number)
20507517186755396443…63184451408782827521
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,724,777 XPM·at block #6,810,087 · 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