Block #854,713

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2014, 8:08:36 PM · Difficulty 10.9685 · 5,987,622 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
edcbd98229d7b9183b622fd1c530bc0f2ae01a517581948a19b4781e9ec524dd

Height

#854,713

Difficulty

10.968494

Transactions

9

Size

1.93 KB

Version

2

Bits

0af7ef41

Nonce

1,740,388,178

Timestamp

12/15/2014, 8:08:36 PM

Confirmations

5,987,622

Merkle Root

e9435f45bc3290a1ba05f3caa815cb63dc08467a4ef9eac42b261991342113a6
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.433 × 10⁹⁶(97-digit number)
14336723575205043390…46934696702513544319
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.433 × 10⁹⁶(97-digit number)
14336723575205043390…46934696702513544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.867 × 10⁹⁶(97-digit number)
28673447150410086781…93869393405027088639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.734 × 10⁹⁶(97-digit number)
57346894300820173562…87738786810054177279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.146 × 10⁹⁷(98-digit number)
11469378860164034712…75477573620108354559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.293 × 10⁹⁷(98-digit number)
22938757720328069425…50955147240216709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.587 × 10⁹⁷(98-digit number)
45877515440656138850…01910294480433418239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.175 × 10⁹⁷(98-digit number)
91755030881312277700…03820588960866836479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.835 × 10⁹⁸(99-digit number)
18351006176262455540…07641177921733672959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.670 × 10⁹⁸(99-digit number)
36702012352524911080…15282355843467345919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.340 × 10⁹⁸(99-digit number)
73404024705049822160…30564711686934691839
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,983,086 XPM·at block #6,842,334 · 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