Block #657,382

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/1/2014, 4:24:26 AM · Difficulty 10.9564 · 6,160,074 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb649a5fc31e5cc7db90df5c2178f542a3621093fb1d1a83302c5fa2fc0c1528

Height

#657,382

Difficulty

10.956357

Transactions

6

Size

9.98 KB

Version

2

Bits

0af4d3d3

Nonce

24,429,328

Timestamp

8/1/2014, 4:24:26 AM

Confirmations

6,160,074

Merkle Root

55bfdeb652ef57203dd017e0b5a7d94839f0f3f8c92578e39e8ab266ce406c2f
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.409 × 10⁹⁵(96-digit number)
14095972239381520681…84987238588982496241
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.409 × 10⁹⁵(96-digit number)
14095972239381520681…84987238588982496241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.819 × 10⁹⁵(96-digit number)
28191944478763041363…69974477177964992481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.638 × 10⁹⁵(96-digit number)
56383888957526082727…39948954355929984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.127 × 10⁹⁶(97-digit number)
11276777791505216545…79897908711859969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.255 × 10⁹⁶(97-digit number)
22553555583010433091…59795817423719939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.510 × 10⁹⁶(97-digit number)
45107111166020866182…19591634847439879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.021 × 10⁹⁶(97-digit number)
90214222332041732364…39183269694879759361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.804 × 10⁹⁷(98-digit number)
18042844466408346472…78366539389759518721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.608 × 10⁹⁷(98-digit number)
36085688932816692945…56733078779519037441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.217 × 10⁹⁷(98-digit number)
72171377865633385891…13466157559038074881
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,783,697 XPM·at block #6,817,455 · 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.
Privacy Policy·

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