Block #857,722

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 1:13:45 AM · Difficulty 10.9675 · 5,984,114 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
251e53efbda10e3e5eb161f08232eaa51f5d521081527c6c74651cc0ad58370f

Height

#857,722

Difficulty

10.967463

Transactions

9

Size

2.47 KB

Version

2

Bits

0af7aba2

Nonce

374,247,404

Timestamp

12/18/2014, 1:13:45 AM

Confirmations

5,984,114

Merkle Root

9495ac7caa94cf1436c9c74b8d5040601fd5280feba85f54190c3eebacf9a8a2
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.482 × 10⁹⁶(97-digit number)
44824833200148879044…99320643697549374081
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.482 × 10⁹⁶(97-digit number)
44824833200148879044…99320643697549374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.964 × 10⁹⁶(97-digit number)
89649666400297758088…98641287395098748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.792 × 10⁹⁷(98-digit number)
17929933280059551617…97282574790197496321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.585 × 10⁹⁷(98-digit number)
35859866560119103235…94565149580394992641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.171 × 10⁹⁷(98-digit number)
71719733120238206470…89130299160789985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.434 × 10⁹⁸(99-digit number)
14343946624047641294…78260598321579970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.868 × 10⁹⁸(99-digit number)
28687893248095282588…56521196643159941121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.737 × 10⁹⁸(99-digit number)
57375786496190565176…13042393286319882241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.147 × 10⁹⁹(100-digit number)
11475157299238113035…26084786572639764481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.295 × 10⁹⁹(100-digit number)
22950314598476226070…52169573145279528961
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,979,061 XPM·at block #6,841,835 · 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