Block #670,918

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/9/2014, 10:14:57 PM · Difficulty 10.9642 · 6,138,200 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60adc2baa1de65324fdce849e906c2bab165ab90c1f285e84dce33a1517fefb2

Height

#670,918

Difficulty

10.964189

Transactions

5

Size

1.23 KB

Version

2

Bits

0af6d517

Nonce

2,094,846,721

Timestamp

8/9/2014, 10:14:57 PM

Confirmations

6,138,200

Merkle Root

2473e8def7df6f720bfe2927721ab200ae4798c5de362419f121fb2594c5c76a
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.

2.655 × 10⁹⁷(98-digit number)
26558739459714138458…27521126859931518721
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
2.655 × 10⁹⁷(98-digit number)
26558739459714138458…27521126859931518721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.311 × 10⁹⁷(98-digit number)
53117478919428276917…55042253719863037441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.062 × 10⁹⁸(99-digit number)
10623495783885655383…10084507439726074881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.124 × 10⁹⁸(99-digit number)
21246991567771310766…20169014879452149761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.249 × 10⁹⁸(99-digit number)
42493983135542621533…40338029758904299521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.498 × 10⁹⁸(99-digit number)
84987966271085243067…80676059517808599041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.699 × 10⁹⁹(100-digit number)
16997593254217048613…61352119035617198081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.399 × 10⁹⁹(100-digit number)
33995186508434097227…22704238071234396161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.799 × 10⁹⁹(100-digit number)
67990373016868194454…45408476142468792321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.359 × 10¹⁰⁰(101-digit number)
13598074603373638890…90816952284937584641
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,717,001 XPM·at block #6,809,117 · 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