Block #846,591

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 5:27:05 PM · Difficulty 10.9722 · 5,989,978 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dce0a1fce7b63b657c8d29f397b4df0a517a92cc1dad7b8d7de9ba2716b71b22

Height

#846,591

Difficulty

10.972222

Transactions

4

Size

884 B

Version

2

Bits

0af8e38a

Nonce

406,970,941

Timestamp

12/9/2014, 5:27:05 PM

Confirmations

5,989,978

Merkle Root

05c4b7fab106956eb5c2ff65b56c0708aac92451c6fb78737fb121bcf54793dd
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.554 × 10⁹⁶(97-digit number)
15541720384170738213…91378002779972951041
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.554 × 10⁹⁶(97-digit number)
15541720384170738213…91378002779972951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.108 × 10⁹⁶(97-digit number)
31083440768341476427…82756005559945902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.216 × 10⁹⁶(97-digit number)
62166881536682952855…65512011119891804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.243 × 10⁹⁷(98-digit number)
12433376307336590571…31024022239783608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.486 × 10⁹⁷(98-digit number)
24866752614673181142…62048044479567216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.973 × 10⁹⁷(98-digit number)
49733505229346362284…24096088959134433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.946 × 10⁹⁷(98-digit number)
99467010458692724568…48192177918268866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.989 × 10⁹⁸(99-digit number)
19893402091738544913…96384355836537733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.978 × 10⁹⁸(99-digit number)
39786804183477089827…92768711673075466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.957 × 10⁹⁸(99-digit number)
79573608366954179655…85537423346150932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.591 × 10⁹⁹(100-digit number)
15914721673390835931…71074846692301864961
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,936,817 XPM·at block #6,836,568 · 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