Block #2,477,351

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2018, 2:18:03 PM · Difficulty 10.9649 · 4,356,331 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
83300638c108b0c538bd73c70996726cd68d49bed6db2f1f3cc89ca5a612a8c2

Height

#2,477,351

Difficulty

10.964880

Transactions

31

Size

8.80 KB

Version

2

Bits

0af7025a

Nonce

311,047,702

Timestamp

1/17/2018, 2:18:03 PM

Confirmations

4,356,331

Merkle Root

eba71d00a3a92b90315c418777f5ed20e368596152fb9af989e7dd7170143195
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.505 × 10⁹⁵(96-digit number)
85053804206472846444…02178976208262064001
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.505 × 10⁹⁵(96-digit number)
85053804206472846444…02178976208262064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.701 × 10⁹⁶(97-digit number)
17010760841294569288…04357952416524128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.402 × 10⁹⁶(97-digit number)
34021521682589138577…08715904833048256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.804 × 10⁹⁶(97-digit number)
68043043365178277155…17431809666096512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.360 × 10⁹⁷(98-digit number)
13608608673035655431…34863619332193024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.721 × 10⁹⁷(98-digit number)
27217217346071310862…69727238664386048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.443 × 10⁹⁷(98-digit number)
54434434692142621724…39454477328772096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.088 × 10⁹⁸(99-digit number)
10886886938428524344…78908954657544192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.177 × 10⁹⁸(99-digit number)
21773773876857048689…57817909315088384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.354 × 10⁹⁸(99-digit number)
43547547753714097379…15635818630176768001
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,913,675 XPM·at block #6,833,681 · 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