Block #2,268,587

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/26/2017, 8:39:11 AM · Difficulty 10.9525 · 4,562,357 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
93c2abcee3a980c5955a42a6069bacb43ac9002983d847c59a6f5da2e8d9fedd

Height

#2,268,587

Difficulty

10.952465

Transactions

2

Size

1.32 KB

Version

2

Bits

0af3d4bb

Nonce

780,826,566

Timestamp

8/26/2017, 8:39:11 AM

Confirmations

4,562,357

Merkle Root

52523a15cb99d098ce0fda9b303495a17e0d63b1997d1efb04394695fb24f468
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.439 × 10⁹⁶(97-digit number)
84395370394267826722…77760434308604303361
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.439 × 10⁹⁶(97-digit number)
84395370394267826722…77760434308604303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.687 × 10⁹⁷(98-digit number)
16879074078853565344…55520868617208606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.375 × 10⁹⁷(98-digit number)
33758148157707130688…11041737234417213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.751 × 10⁹⁷(98-digit number)
67516296315414261377…22083474468834426881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.350 × 10⁹⁸(99-digit number)
13503259263082852275…44166948937668853761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.700 × 10⁹⁸(99-digit number)
27006518526165704551…88333897875337707521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.401 × 10⁹⁸(99-digit number)
54013037052331409102…76667795750675415041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.080 × 10⁹⁹(100-digit number)
10802607410466281820…53335591501350830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.160 × 10⁹⁹(100-digit number)
21605214820932563640…06671183002701660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.321 × 10⁹⁹(100-digit number)
43210429641865127281…13342366005403320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.642 × 10⁹⁹(100-digit number)
86420859283730254563…26684732010806640641
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,891,687 XPM·at block #6,830,943 · 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