Block #848,443

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 2:25:30 AM · Difficulty 10.9716 · 5,996,498 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2557a945b9885ea2d8ece0e3f98f9229cc4fe4dfaaf6de267369b41c8e2d8b5d

Height

#848,443

Difficulty

10.971574

Transactions

14

Size

3.40 KB

Version

2

Bits

0af8b913

Nonce

669,412,769

Timestamp

12/11/2014, 2:25:30 AM

Confirmations

5,996,498

Merkle Root

31169e919dd8a2212f2689281354a5e127e0198b106a9f6f43f461a02d81d513
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.

8.328 × 10⁹¹(92-digit number)
83281974260370801536…23104452576026159519
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
8.328 × 10⁹¹(92-digit number)
83281974260370801536…23104452576026159519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.665 × 10⁹²(93-digit number)
16656394852074160307…46208905152052319039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.331 × 10⁹²(93-digit number)
33312789704148320614…92417810304104638079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.662 × 10⁹²(93-digit number)
66625579408296641228…84835620608209276159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.332 × 10⁹³(94-digit number)
13325115881659328245…69671241216418552319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.665 × 10⁹³(94-digit number)
26650231763318656491…39342482432837104639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.330 × 10⁹³(94-digit number)
53300463526637312983…78684964865674209279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.066 × 10⁹⁴(95-digit number)
10660092705327462596…57369929731348418559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.132 × 10⁹⁴(95-digit number)
21320185410654925193…14739859462696837119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.264 × 10⁹⁴(95-digit number)
42640370821309850386…29479718925393674239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.528 × 10⁹⁴(95-digit number)
85280741642619700772…58959437850787348479
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,003,947 XPM·at block #6,844,940 · 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