Block #2,865,310

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/3/2018, 9:58:28 AM · Difficulty 11.6704 · 3,978,649 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6d9045a4d5d821a764a7ab53ff7ab9292b130cfeac4c9b0a51931ab552a541c

Height

#2,865,310

Difficulty

11.670382

Transactions

5

Size

1001 B

Version

2

Bits

0bab9e23

Nonce

1,032,251,866

Timestamp

10/3/2018, 9:58:28 AM

Confirmations

3,978,649

Merkle Root

a360df16ea4d211125a613c96eae43b8193ed1d7ad667c83105c661e73baca29
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.329 × 10⁹⁴(95-digit number)
23292048243710797557…07578801022325886531
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.329 × 10⁹⁴(95-digit number)
23292048243710797557…07578801022325886531
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.658 × 10⁹⁴(95-digit number)
46584096487421595115…15157602044651773061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.316 × 10⁹⁴(95-digit number)
93168192974843190231…30315204089303546121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.863 × 10⁹⁵(96-digit number)
18633638594968638046…60630408178607092241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.726 × 10⁹⁵(96-digit number)
37267277189937276092…21260816357214184481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.453 × 10⁹⁵(96-digit number)
74534554379874552185…42521632714428368961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.490 × 10⁹⁶(97-digit number)
14906910875974910437…85043265428856737921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.981 × 10⁹⁶(97-digit number)
29813821751949820874…70086530857713475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.962 × 10⁹⁶(97-digit number)
59627643503899641748…40173061715426951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.192 × 10⁹⁷(98-digit number)
11925528700779928349…80346123430853903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.385 × 10⁹⁷(98-digit number)
23851057401559856699…60692246861707806721
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,996,048 XPM·at block #6,843,958 · 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