Block #842,054

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2014, 8:26:33 AM · Difficulty 10.9738 · 6,002,933 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1265417943fbd8aefbb5226eac9b13d83f54a624cb1ce1b6ba693d9677c57ad7

Height

#842,054

Difficulty

10.973818

Transactions

2

Size

431 B

Version

2

Bits

0af94c23

Nonce

1,408,364,300

Timestamp

12/6/2014, 8:26:33 AM

Confirmations

6,002,933

Merkle Root

338fb131d2ad23d1ce48900f37b251210a46e2d64c683ae66d35e17fb9efb818
Transactions (2)
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.767 × 10⁹⁴(95-digit number)
17676958078591293269…95125351414920557259
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.767 × 10⁹⁴(95-digit number)
17676958078591293269…95125351414920557259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.535 × 10⁹⁴(95-digit number)
35353916157182586538…90250702829841114519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.070 × 10⁹⁴(95-digit number)
70707832314365173076…80501405659682229039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.414 × 10⁹⁵(96-digit number)
14141566462873034615…61002811319364458079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.828 × 10⁹⁵(96-digit number)
28283132925746069230…22005622638728916159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.656 × 10⁹⁵(96-digit number)
56566265851492138461…44011245277457832319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.131 × 10⁹⁶(97-digit number)
11313253170298427692…88022490554915664639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.262 × 10⁹⁶(97-digit number)
22626506340596855384…76044981109831329279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.525 × 10⁹⁶(97-digit number)
45253012681193710768…52089962219662658559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.050 × 10⁹⁶(97-digit number)
90506025362387421537…04179924439325317119
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,004,315 XPM·at block #6,844,986 · 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