Block #673,968

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/11/2014, 10:39:01 PM · Difficulty 10.9653 · 6,135,886 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7af7cef866a1dd4302b17ce30209a8d6799a4988652ab9346563a4c2e574663e

Height

#673,968

Difficulty

10.965304

Transactions

5

Size

1.66 KB

Version

2

Bits

0af71e2e

Nonce

180,459,948

Timestamp

8/11/2014, 10:39:01 PM

Confirmations

6,135,886

Merkle Root

c8ba162618ea2c551889580d95581d53fd36fc16cc2ec51e09bf2957ed64fca9
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.196 × 10⁹⁷(98-digit number)
11961714002424305070…71114895525080860161
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.196 × 10⁹⁷(98-digit number)
11961714002424305070…71114895525080860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.392 × 10⁹⁷(98-digit number)
23923428004848610141…42229791050161720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.784 × 10⁹⁷(98-digit number)
47846856009697220282…84459582100323440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.569 × 10⁹⁷(98-digit number)
95693712019394440565…68919164200646881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.913 × 10⁹⁸(99-digit number)
19138742403878888113…37838328401293762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.827 × 10⁹⁸(99-digit number)
38277484807757776226…75676656802587525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.655 × 10⁹⁸(99-digit number)
76554969615515552452…51353313605175050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.531 × 10⁹⁹(100-digit number)
15310993923103110490…02706627210350100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.062 × 10⁹⁹(100-digit number)
30621987846206220981…05413254420700200961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.124 × 10⁹⁹(100-digit number)
61243975692412441962…10826508841400401921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.224 × 10¹⁰⁰(101-digit number)
12248795138482488392…21653017682800803841
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,722,919 XPM·at block #6,809,853 · 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