Block #853,653

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2014, 1:14:42 AM · Difficulty 10.9689 · 5,957,117 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
01e1979909e6252b6448cb915c872af76b71b8d33354fdc0c82527e8fa274a08

Height

#853,653

Difficulty

10.968932

Transactions

4

Size

1.73 KB

Version

2

Bits

0af80bf5

Nonce

1,758,165,573

Timestamp

12/15/2014, 1:14:42 AM

Confirmations

5,957,117

Merkle Root

7991d65ebc75262f4294904dcb6cbc447bf7ac603c004351ea66793f19fa6373
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.

6.659 × 10⁹⁷(98-digit number)
66599488859857109659…96223069894437396481
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
6.659 × 10⁹⁷(98-digit number)
66599488859857109659…96223069894437396481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.331 × 10⁹⁸(99-digit number)
13319897771971421931…92446139788874792961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.663 × 10⁹⁸(99-digit number)
26639795543942843863…84892279577749585921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.327 × 10⁹⁸(99-digit number)
53279591087885687727…69784559155499171841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.065 × 10⁹⁹(100-digit number)
10655918217577137545…39569118310998343681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.131 × 10⁹⁹(100-digit number)
21311836435154275091…79138236621996687361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.262 × 10⁹⁹(100-digit number)
42623672870308550182…58276473243993374721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.524 × 10⁹⁹(100-digit number)
85247345740617100364…16552946487986749441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.704 × 10¹⁰⁰(101-digit number)
17049469148123420072…33105892975973498881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.409 × 10¹⁰⁰(101-digit number)
34098938296246840145…66211785951946997761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.819 × 10¹⁰⁰(101-digit number)
68197876592493680291…32423571903893995521
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,730,255 XPM·at block #6,810,769 · 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