Block #852,314

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 11:36:40 PM · Difficulty 10.9701 · 5,989,351 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a724afff77590a9b353e5f4dd9f64d38ccac3733055f20e244fae73ff563bd47

Height

#852,314

Difficulty

10.970080

Transactions

7

Size

1.53 KB

Version

2

Bits

0af85728

Nonce

344,340,951

Timestamp

12/13/2014, 11:36:40 PM

Confirmations

5,989,351

Merkle Root

47491fd34df3e9a0062569e5cef3d7d9bd7177fb3cfa622c9f0efc202f92010b
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.675 × 10⁹⁷(98-digit number)
16750700272884618925…51633111735182950401
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.675 × 10⁹⁷(98-digit number)
16750700272884618925…51633111735182950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.350 × 10⁹⁷(98-digit number)
33501400545769237851…03266223470365900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.700 × 10⁹⁷(98-digit number)
67002801091538475703…06532446940731801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.340 × 10⁹⁸(99-digit number)
13400560218307695140…13064893881463603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.680 × 10⁹⁸(99-digit number)
26801120436615390281…26129787762927206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.360 × 10⁹⁸(99-digit number)
53602240873230780562…52259575525854412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.072 × 10⁹⁹(100-digit number)
10720448174646156112…04519151051708825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.144 × 10⁹⁹(100-digit number)
21440896349292312225…09038302103417651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.288 × 10⁹⁹(100-digit number)
42881792698584624450…18076604206835302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.576 × 10⁹⁹(100-digit number)
85763585397169248900…36153208413670604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.715 × 10¹⁰⁰(101-digit number)
17152717079433849780…72306416827341209601
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,977,709 XPM·at block #6,841,664 · 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