Block #847,335

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 6:42:51 AM · Difficulty 10.9720 · 5,993,450 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1c393b53253490b857c2b3b27cb85ed140dec97d0081c9a5fea63c569f8d4a8

Height

#847,335

Difficulty

10.971958

Transactions

3

Size

660 B

Version

2

Bits

0af8d240

Nonce

1,082,685,317

Timestamp

12/10/2014, 6:42:51 AM

Confirmations

5,993,450

Merkle Root

2c803c88ce2e5610e696bb76e4b4a487a44577dbd4e33fa4fa9b30b9e0039a3b
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.020 × 10⁹⁸(99-digit number)
10202831627665866208…21432251319347978239
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.020 × 10⁹⁸(99-digit number)
10202831627665866208…21432251319347978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.040 × 10⁹⁸(99-digit number)
20405663255331732417…42864502638695956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.081 × 10⁹⁸(99-digit number)
40811326510663464834…85729005277391912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.162 × 10⁹⁸(99-digit number)
81622653021326929669…71458010554783825919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.632 × 10⁹⁹(100-digit number)
16324530604265385933…42916021109567651839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.264 × 10⁹⁹(100-digit number)
32649061208530771867…85832042219135303679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.529 × 10⁹⁹(100-digit number)
65298122417061543735…71664084438270607359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.305 × 10¹⁰⁰(101-digit number)
13059624483412308747…43328168876541214719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.611 × 10¹⁰⁰(101-digit number)
26119248966824617494…86656337753082429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.223 × 10¹⁰⁰(101-digit number)
52238497933649234988…73312675506164858879
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:57,970,626 XPM·at block #6,840,784 · 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