Block #2,576,331

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2018, 6:52:50 PM · Difficulty 10.9957 · 4,266,483 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
534ff9b083826efb928ba7b733ef502f166abb7e0ad7a1fc2ac6d22a6beaadbd

Height

#2,576,331

Difficulty

10.995697

Transactions

6

Size

3.88 KB

Version

2

Bits

0afee5fe

Nonce

84,316,463

Timestamp

3/20/2018, 6:52:50 PM

Confirmations

4,266,483

Merkle Root

8722640273b04fc38710211aec70aca15a13e3c6c65be6c28e9da2f0b6873da4
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.788 × 10⁹⁴(95-digit number)
27886445710865631164…98579506730790092801
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.788 × 10⁹⁴(95-digit number)
27886445710865631164…98579506730790092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.577 × 10⁹⁴(95-digit number)
55772891421731262328…97159013461580185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.115 × 10⁹⁵(96-digit number)
11154578284346252465…94318026923160371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.230 × 10⁹⁵(96-digit number)
22309156568692504931…88636053846320742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.461 × 10⁹⁵(96-digit number)
44618313137385009862…77272107692641484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.923 × 10⁹⁵(96-digit number)
89236626274770019724…54544215385282969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.784 × 10⁹⁶(97-digit number)
17847325254954003944…09088430770565939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.569 × 10⁹⁶(97-digit number)
35694650509908007889…18176861541131878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.138 × 10⁹⁶(97-digit number)
71389301019816015779…36353723082263756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.427 × 10⁹⁷(98-digit number)
14277860203963203155…72707446164527513601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,986,852 XPM·at block #6,842,813 · 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