Block #860,971

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2014, 4:00:15 PM · Difficulty 10.9641 · 5,953,884 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9cd465f1bc7031f69357428e9bc59e5bcffbc812c09f85a42db1791c681a7be

Height

#860,971

Difficulty

10.964053

Transactions

14

Size

4.96 KB

Version

2

Bits

0af6cc33

Nonce

1,720,055,757

Timestamp

12/20/2014, 4:00:15 PM

Confirmations

5,953,884

Merkle Root

2c39817654f2a22ff1901494284b278f995c4f0d61b6cfa2b045da1e77d97827
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.054 × 10⁹⁷(98-digit number)
10547661487195523174…27166028807375339521
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.054 × 10⁹⁷(98-digit number)
10547661487195523174…27166028807375339521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.109 × 10⁹⁷(98-digit number)
21095322974391046349…54332057614750679041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.219 × 10⁹⁷(98-digit number)
42190645948782092698…08664115229501358081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.438 × 10⁹⁷(98-digit number)
84381291897564185397…17328230459002716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.687 × 10⁹⁸(99-digit number)
16876258379512837079…34656460918005432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.375 × 10⁹⁸(99-digit number)
33752516759025674158…69312921836010864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.750 × 10⁹⁸(99-digit number)
67505033518051348317…38625843672021729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.350 × 10⁹⁹(100-digit number)
13501006703610269663…77251687344043458561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.700 × 10⁹⁹(100-digit number)
27002013407220539327…54503374688086917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.400 × 10⁹⁹(100-digit number)
54004026814441078654…09006749376173834241
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,762,923 XPM·at block #6,814,854 · 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