Block #854,673

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2014, 7:28:29 PM · Difficulty 10.9685 · 5,971,762 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f9a63fb2e075cd371454a80e26cbda438a654b6b0230a48feef655baa1509a29

Height

#854,673

Difficulty

10.968496

Transactions

14

Size

3.44 KB

Version

2

Bits

0af7ef61

Nonce

457,907,804

Timestamp

12/15/2014, 7:28:29 PM

Confirmations

5,971,762

Merkle Root

3301e68561077b6fee4d470b23ca1b084a72d21ea84813197681a26941d455a5
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.943 × 10⁹⁵(96-digit number)
19430626916459009484…08358881551759977001
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.943 × 10⁹⁵(96-digit number)
19430626916459009484…08358881551759977001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.886 × 10⁹⁵(96-digit number)
38861253832918018969…16717763103519954001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.772 × 10⁹⁵(96-digit number)
77722507665836037938…33435526207039908001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.554 × 10⁹⁶(97-digit number)
15544501533167207587…66871052414079816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.108 × 10⁹⁶(97-digit number)
31089003066334415175…33742104828159632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.217 × 10⁹⁶(97-digit number)
62178006132668830350…67484209656319264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.243 × 10⁹⁷(98-digit number)
12435601226533766070…34968419312638528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.487 × 10⁹⁷(98-digit number)
24871202453067532140…69936838625277056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.974 × 10⁹⁷(98-digit number)
49742404906135064280…39873677250554112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.948 × 10⁹⁷(98-digit number)
99484809812270128561…79747354501108224001
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,855,617 XPM·at block #6,826,434 · 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