Block #668,946

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2014, 2:17:41 PM · Difficulty 10.9637 · 6,141,671 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ddbb820361541082f1929b6630d51e974a77f95c7729c3aaacc41715dfe981a4

Height

#668,946

Difficulty

10.963728

Transactions

6

Size

1.88 KB

Version

2

Bits

0af6b6e7

Nonce

112,265,483

Timestamp

8/8/2014, 2:17:41 PM

Confirmations

6,141,671

Merkle Root

fd28acee0d8be6652bce10a1fc9c69bcca7f80d4fc670d1f634684ada8bfb5a2
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.

3.641 × 10⁹³(94-digit number)
36411732688777347145…12358263808927317481
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
3.641 × 10⁹³(94-digit number)
36411732688777347145…12358263808927317481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.282 × 10⁹³(94-digit number)
72823465377554694290…24716527617854634961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.456 × 10⁹⁴(95-digit number)
14564693075510938858…49433055235709269921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.912 × 10⁹⁴(95-digit number)
29129386151021877716…98866110471418539841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.825 × 10⁹⁴(95-digit number)
58258772302043755432…97732220942837079681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.165 × 10⁹⁵(96-digit number)
11651754460408751086…95464441885674159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.330 × 10⁹⁵(96-digit number)
23303508920817502172…90928883771348318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.660 × 10⁹⁵(96-digit number)
46607017841635004345…81857767542696637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.321 × 10⁹⁵(96-digit number)
93214035683270008691…63715535085393274881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.864 × 10⁹⁶(97-digit number)
18642807136654001738…27431070170786549761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.728 × 10⁹⁶(97-digit number)
37285614273308003476…54862140341573099521
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,729,020 XPM·at block #6,810,616 · 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