Block #689,890

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/24/2014, 12:03:45 AM · Difficulty 10.9544 · 6,117,065 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
030a6675b514a06c7368b784f3b5a78347c150f02e8c1e3b81fb3b162c98a23e

Height

#689,890

Difficulty

10.954401

Transactions

2

Size

9.38 KB

Version

2

Bits

0af4539b

Nonce

611,479,379

Timestamp

8/24/2014, 12:03:45 AM

Confirmations

6,117,065

Merkle Root

57425c9492d18dd48d6daac58f43646541a1e1730fb0fd0570d33f143785543d
Transactions (2)
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.

8.971 × 10⁹¹(92-digit number)
89715014692369235077…88190445016304182101
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
8.971 × 10⁹¹(92-digit number)
89715014692369235077…88190445016304182101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.794 × 10⁹²(93-digit number)
17943002938473847015…76380890032608364201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.588 × 10⁹²(93-digit number)
35886005876947694031…52761780065216728401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.177 × 10⁹²(93-digit number)
71772011753895388062…05523560130433456801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.435 × 10⁹³(94-digit number)
14354402350779077612…11047120260866913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.870 × 10⁹³(94-digit number)
28708804701558155224…22094240521733827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.741 × 10⁹³(94-digit number)
57417609403116310449…44188481043467654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.148 × 10⁹⁴(95-digit number)
11483521880623262089…88376962086935308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.296 × 10⁹⁴(95-digit number)
22967043761246524179…76753924173870617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.593 × 10⁹⁴(95-digit number)
45934087522493048359…53507848347741235201
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,699,738 XPM·at block #6,806,954 · 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