Block #2,869,216

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/6/2018, 2:58:44 AM · Difficulty 11.6709 · 3,967,437 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c9a957066d8a5a7e38b3eab35d9e8ba7ff84c7a11e8d128b8afeb575d30137f

Height

#2,869,216

Difficulty

11.670917

Transactions

32

Size

6.83 KB

Version

2

Bits

0babc13c

Nonce

537,196,957

Timestamp

10/6/2018, 2:58:44 AM

Confirmations

3,967,437

Merkle Root

1588f33ef015ec0750bdec6c08acd9d11e8523d8a98b89d106d5820e5abbdd19
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.845 × 10⁹⁴(95-digit number)
28454523574194124111…94898108917895823781
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.845 × 10⁹⁴(95-digit number)
28454523574194124111…94898108917895823781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.690 × 10⁹⁴(95-digit number)
56909047148388248222…89796217835791647561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.138 × 10⁹⁵(96-digit number)
11381809429677649644…79592435671583295121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.276 × 10⁹⁵(96-digit number)
22763618859355299288…59184871343166590241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.552 × 10⁹⁵(96-digit number)
45527237718710598577…18369742686333180481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.105 × 10⁹⁵(96-digit number)
91054475437421197155…36739485372666360961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.821 × 10⁹⁶(97-digit number)
18210895087484239431…73478970745332721921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.642 × 10⁹⁶(97-digit number)
36421790174968478862…46957941490665443841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.284 × 10⁹⁶(97-digit number)
72843580349936957724…93915882981330887681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.456 × 10⁹⁷(98-digit number)
14568716069987391544…87831765962661775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.913 × 10⁹⁷(98-digit number)
29137432139974783089…75663531925323550721
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,937,499 XPM·at block #6,836,652 · 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