Block #666,932

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2014, 8:56:25 AM · Difficulty 10.9618 · 6,157,725 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
33faa923d5a7bdbcdea0cce2a723d00ef448fff76a1b8ec5ae99704c1ea7edd9

Height

#666,932

Difficulty

10.961816

Transactions

3

Size

957 B

Version

2

Bits

0af63994

Nonce

317,959,746

Timestamp

8/7/2014, 8:56:25 AM

Confirmations

6,157,725

Merkle Root

03132e51ca5ae0c89aa8c5319ee4ee49c57de1044401bea59900939d89d58998
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.144 × 10⁹⁶(97-digit number)
21442976027707963394…06987751175407206401
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.144 × 10⁹⁶(97-digit number)
21442976027707963394…06987751175407206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.288 × 10⁹⁶(97-digit number)
42885952055415926788…13975502350814412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.577 × 10⁹⁶(97-digit number)
85771904110831853577…27951004701628825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.715 × 10⁹⁷(98-digit number)
17154380822166370715…55902009403257651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.430 × 10⁹⁷(98-digit number)
34308761644332741431…11804018806515302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.861 × 10⁹⁷(98-digit number)
68617523288665482862…23608037613030604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.372 × 10⁹⁸(99-digit number)
13723504657733096572…47216075226061209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.744 × 10⁹⁸(99-digit number)
27447009315466193144…94432150452122419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.489 × 10⁹⁸(99-digit number)
54894018630932386289…88864300904244838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.097 × 10⁹⁹(100-digit number)
10978803726186477257…77728601808489676801
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,841,320 XPM·at block #6,824,656 · 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