Block #2,664,066

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2018, 6:46:52 PM · Difficulty 11.6516 · 4,181,191 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0181b3a7d1ec16226f77205b2a0ad168e306862b1547568527ab1250702af1b7

Height

#2,664,066

Difficulty

11.651597

Transactions

10

Size

2.93 KB

Version

2

Bits

0ba6cf08

Nonce

863,156,167

Timestamp

5/16/2018, 6:46:52 PM

Confirmations

4,181,191

Merkle Root

3ed6d264e2d6303db883d968b0606b7a8deb680df0a2e64fa3f423e4e422d2a4
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.009 × 10⁹⁴(95-digit number)
10097391358450709963…90608359983716381921
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.009 × 10⁹⁴(95-digit number)
10097391358450709963…90608359983716381921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.019 × 10⁹⁴(95-digit number)
20194782716901419926…81216719967432763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.038 × 10⁹⁴(95-digit number)
40389565433802839853…62433439934865527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.077 × 10⁹⁴(95-digit number)
80779130867605679706…24866879869731055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.615 × 10⁹⁵(96-digit number)
16155826173521135941…49733759739462110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.231 × 10⁹⁵(96-digit number)
32311652347042271882…99467519478924221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.462 × 10⁹⁵(96-digit number)
64623304694084543765…98935038957848442881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.292 × 10⁹⁶(97-digit number)
12924660938816908753…97870077915696885761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.584 × 10⁹⁶(97-digit number)
25849321877633817506…95740155831393771521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.169 × 10⁹⁶(97-digit number)
51698643755267635012…91480311662787543041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.033 × 10⁹⁷(98-digit number)
10339728751053527002…82960623325575086081
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:58,006,489 XPM·at block #6,845,256 · 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