Block #2,576,244

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2018, 5:46:59 PM · Difficulty 10.9957 · 4,264,809 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e4837fbdba60df942e18b11f70cbd8c1471746bb63bb547e98419500acb5dd8

Height

#2,576,244

Difficulty

10.995675

Transactions

22

Size

6.05 KB

Version

2

Bits

0afee491

Nonce

641,612,257

Timestamp

3/20/2018, 5:46:59 PM

Confirmations

4,264,809

Merkle Root

87385fef6b1b0f2d9ea6165ba40ed782fdd9c2e020f6e8b2e080202e4f313506
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.329 × 10⁹⁶(97-digit number)
43299385222977873079…93606407578931008001
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.329 × 10⁹⁶(97-digit number)
43299385222977873079…93606407578931008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.659 × 10⁹⁶(97-digit number)
86598770445955746158…87212815157862016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.731 × 10⁹⁷(98-digit number)
17319754089191149231…74425630315724032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.463 × 10⁹⁷(98-digit number)
34639508178382298463…48851260631448064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.927 × 10⁹⁷(98-digit number)
69279016356764596926…97702521262896128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.385 × 10⁹⁸(99-digit number)
13855803271352919385…95405042525792256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.771 × 10⁹⁸(99-digit number)
27711606542705838770…90810085051584512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.542 × 10⁹⁸(99-digit number)
55423213085411677541…81620170103169024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.108 × 10⁹⁹(100-digit number)
11084642617082335508…63240340206338048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.216 × 10⁹⁹(100-digit number)
22169285234164671016…26480680412676096001
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,972,787 XPM·at block #6,841,052 · 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