Block #843,445

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 9:42:22 AM · Difficulty 10.9732 · 5,998,172 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
099d756d5553ad0383fc8279c2cc821597abee67c54b0a715b01ca0f7f894892

Height

#843,445

Difficulty

10.973202

Transactions

7

Size

2.10 KB

Version

2

Bits

0af923c7

Nonce

967,539,746

Timestamp

12/7/2014, 9:42:22 AM

Confirmations

5,998,172

Merkle Root

572aafbba6819a20d01b1db457f3bd981ddea35726f6f06ee1263997db4f3f97
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.

1.484 × 10⁹⁶(97-digit number)
14849127228764699151…60054217141585981441
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
1.484 × 10⁹⁶(97-digit number)
14849127228764699151…60054217141585981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.969 × 10⁹⁶(97-digit number)
29698254457529398302…20108434283171962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.939 × 10⁹⁶(97-digit number)
59396508915058796605…40216868566343925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.187 × 10⁹⁷(98-digit number)
11879301783011759321…80433737132687851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.375 × 10⁹⁷(98-digit number)
23758603566023518642…60867474265375703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.751 × 10⁹⁷(98-digit number)
47517207132047037284…21734948530751406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.503 × 10⁹⁷(98-digit number)
95034414264094074568…43469897061502812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.900 × 10⁹⁸(99-digit number)
19006882852818814913…86939794123005624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.801 × 10⁹⁸(99-digit number)
38013765705637629827…73879588246011248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.602 × 10⁹⁸(99-digit number)
76027531411275259654…47759176492022497281
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,977,318 XPM·at block #6,841,616 · 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