Block #784,267

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/26/2014, 6:31:25 PM · Difficulty 10.9751 · 6,024,942 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8283cadd07bb50420db04c5120853bc2adf9ec5cb54622ac14eede09597f6d8

Height

#784,267

Difficulty

10.975142

Transactions

2

Size

13.24 KB

Version

2

Bits

0af9a2e7

Nonce

140,516,862

Timestamp

10/26/2014, 6:31:25 PM

Confirmations

6,024,942

Merkle Root

986d419918bd6a6ecf3c695d7fb222602079d64e1b687080851c58acf6737072
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.482 × 10⁹⁶(97-digit number)
14822793502941998350…50909089044643743521
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.482 × 10⁹⁶(97-digit number)
14822793502941998350…50909089044643743521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.964 × 10⁹⁶(97-digit number)
29645587005883996700…01818178089287487041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.929 × 10⁹⁶(97-digit number)
59291174011767993400…03636356178574974081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.185 × 10⁹⁷(98-digit number)
11858234802353598680…07272712357149948161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.371 × 10⁹⁷(98-digit number)
23716469604707197360…14545424714299896321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.743 × 10⁹⁷(98-digit number)
47432939209414394720…29090849428599792641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.486 × 10⁹⁷(98-digit number)
94865878418828789440…58181698857199585281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.897 × 10⁹⁸(99-digit number)
18973175683765757888…16363397714399170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.794 × 10⁹⁸(99-digit number)
37946351367531515776…32726795428798341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.589 × 10⁹⁸(99-digit number)
75892702735063031552…65453590857596682241
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,717,732 XPM·at block #6,809,208 · 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.

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