Block #851,506

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 8:26:38 AM · Difficulty 10.9707 · 5,992,023 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ba45e6cffb29d0c59f56849bb8ef52c99c0641d53e563f64e6f3446c087cd9b

Height

#851,506

Difficulty

10.970670

Transactions

9

Size

2.11 KB

Version

2

Bits

0af87ddc

Nonce

285,451,536

Timestamp

12/13/2014, 8:26:38 AM

Confirmations

5,992,023

Merkle Root

c0de440ff6ed7bd066c0556620545c09876d3ce5f174e6770484bfb55231c87d
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.114 × 10⁹⁶(97-digit number)
11145342297606483618…44574385965907592801
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.114 × 10⁹⁶(97-digit number)
11145342297606483618…44574385965907592801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.229 × 10⁹⁶(97-digit number)
22290684595212967237…89148771931815185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.458 × 10⁹⁶(97-digit number)
44581369190425934475…78297543863630371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.916 × 10⁹⁶(97-digit number)
89162738380851868950…56595087727260742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.783 × 10⁹⁷(98-digit number)
17832547676170373790…13190175454521484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.566 × 10⁹⁷(98-digit number)
35665095352340747580…26380350909042969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.133 × 10⁹⁷(98-digit number)
71330190704681495160…52760701818085939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.426 × 10⁹⁸(99-digit number)
14266038140936299032…05521403636171878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.853 × 10⁹⁸(99-digit number)
28532076281872598064…11042807272343756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.706 × 10⁹⁸(99-digit number)
57064152563745196128…22085614544687513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.141 × 10⁹⁹(100-digit number)
11412830512749039225…44171229089375027201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,992,609 XPM·at block #6,843,528 · 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