Block #841,856

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 4:50:21 AM · Difficulty 10.9739 · 5,998,769 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92ccb6b446b0231e76bce2ccbf5ba587c8a68dcbc1a3ca4539ce0759360b4a6f

Height

#841,856

Difficulty

10.973911

Transactions

4

Size

884 B

Version

2

Bits

0af95242

Nonce

215,665,005

Timestamp

12/6/2014, 4:50:21 AM

Confirmations

5,998,769

Merkle Root

5cd2b6a85a9702b92db4f1e8e8adbe159fcf900f807875d19ca4707086ee171f
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.

7.500 × 10⁹⁴(95-digit number)
75001582621270750087…22807146870105531381
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
7.500 × 10⁹⁴(95-digit number)
75001582621270750087…22807146870105531381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.500 × 10⁹⁵(96-digit number)
15000316524254150017…45614293740211062761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.000 × 10⁹⁵(96-digit number)
30000633048508300034…91228587480422125521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.000 × 10⁹⁵(96-digit number)
60001266097016600069…82457174960844251041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.200 × 10⁹⁶(97-digit number)
12000253219403320013…64914349921688502081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.400 × 10⁹⁶(97-digit number)
24000506438806640027…29828699843377004161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.800 × 10⁹⁶(97-digit number)
48001012877613280055…59657399686754008321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.600 × 10⁹⁶(97-digit number)
96002025755226560111…19314799373508016641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.920 × 10⁹⁷(98-digit number)
19200405151045312022…38629598747016033281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.840 × 10⁹⁷(98-digit number)
38400810302090624044…77259197494032066561
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,969,340 XPM·at block #6,840,624 · 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