Block #661,592

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2014, 2:27:58 AM · Difficulty 10.9565 · 6,144,850 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d0246f96170c1a8c7390509011c77c4ce9cb0b87e37bc2a8cab89fb50a674b1b

Height

#661,592

Difficulty

10.956529

Transactions

4

Size

886 B

Version

2

Bits

0af4df16

Nonce

3,835,109,932

Timestamp

8/4/2014, 2:27:58 AM

Confirmations

6,144,850

Merkle Root

279ddd16be9935301898f0b7ba0b3a240a1d26da732c85d34b736e486924f870
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.

7.122 × 10⁹⁶(97-digit number)
71224556865865471488…01229427671839139841
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
7.122 × 10⁹⁶(97-digit number)
71224556865865471488…01229427671839139841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.424 × 10⁹⁷(98-digit number)
14244911373173094297…02458855343678279681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.848 × 10⁹⁷(98-digit number)
28489822746346188595…04917710687356559361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.697 × 10⁹⁷(98-digit number)
56979645492692377190…09835421374713118721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.139 × 10⁹⁸(99-digit number)
11395929098538475438…19670842749426237441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.279 × 10⁹⁸(99-digit number)
22791858197076950876…39341685498852474881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.558 × 10⁹⁸(99-digit number)
45583716394153901752…78683370997704949761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.116 × 10⁹⁸(99-digit number)
91167432788307803505…57366741995409899521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.823 × 10⁹⁹(100-digit number)
18233486557661560701…14733483990819799041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.646 × 10⁹⁹(100-digit number)
36466973115323121402…29466967981639598081
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,695,625 XPM·at block #6,806,441 · 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