Block #2,563,154

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/13/2018, 2:49:42 AM · Difficulty 10.9930 · 4,280,147 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a33ec6d1bd54c28f134c5422be88e0889724e9ab1230afe4afc8f73d1d6e6289

Height

#2,563,154

Difficulty

10.992959

Transactions

6

Size

1.89 KB

Version

2

Bits

0afe3288

Nonce

280,556,517

Timestamp

3/13/2018, 2:49:42 AM

Confirmations

4,280,147

Merkle Root

d0c7e745b1f62051c9fc3804b9f773b149808a79b18d59008c14c6eafbbc31bd
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.

4.801 × 10⁹⁶(97-digit number)
48015043547022273339…45865309767474995201
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
4.801 × 10⁹⁶(97-digit number)
48015043547022273339…45865309767474995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.603 × 10⁹⁶(97-digit number)
96030087094044546679…91730619534949990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.920 × 10⁹⁷(98-digit number)
19206017418808909335…83461239069899980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.841 × 10⁹⁷(98-digit number)
38412034837617818671…66922478139799961601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.682 × 10⁹⁷(98-digit number)
76824069675235637343…33844956279599923201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.536 × 10⁹⁸(99-digit number)
15364813935047127468…67689912559199846401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.072 × 10⁹⁸(99-digit number)
30729627870094254937…35379825118399692801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.145 × 10⁹⁸(99-digit number)
61459255740188509874…70759650236799385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.229 × 10⁹⁹(100-digit number)
12291851148037701974…41519300473598771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.458 × 10⁹⁹(100-digit number)
24583702296075403949…83038600947197542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.916 × 10⁹⁹(100-digit number)
49167404592150807899…66077201894395084801
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,990,773 XPM·at block #6,843,300 · 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