Block #824,553

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/23/2014, 3:50:27 PM · Difficulty 10.9770 · 6,002,583 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
89f139e1e59973c82302f398be8ab9b18a31787c8a584b38618bc959f6de075c

Height

#824,553

Difficulty

10.977014

Transactions

4

Size

876 B

Version

2

Bits

0afa1d9d

Nonce

1,092,487,613

Timestamp

11/23/2014, 3:50:27 PM

Confirmations

6,002,583

Merkle Root

0ad853fae8943374effcf0ddb3c8e866d6c8ff32ccdd3fc2d764b1e86b028937
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.

2.342 × 10⁹⁵(96-digit number)
23423074088384942811…29311884163446261759
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
2.342 × 10⁹⁵(96-digit number)
23423074088384942811…29311884163446261759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.684 × 10⁹⁵(96-digit number)
46846148176769885622…58623768326892523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.369 × 10⁹⁵(96-digit number)
93692296353539771244…17247536653785047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.873 × 10⁹⁶(97-digit number)
18738459270707954248…34495073307570094079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.747 × 10⁹⁶(97-digit number)
37476918541415908497…68990146615140188159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.495 × 10⁹⁶(97-digit number)
74953837082831816995…37980293230280376319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.499 × 10⁹⁷(98-digit number)
14990767416566363399…75960586460560752639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.998 × 10⁹⁷(98-digit number)
29981534833132726798…51921172921121505279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.996 × 10⁹⁷(98-digit number)
59963069666265453596…03842345842243010559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.199 × 10⁹⁸(99-digit number)
11992613933253090719…07684691684486021119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.398 × 10⁹⁸(99-digit number)
23985227866506181438…15369383368972042239
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:57,861,269 XPM·at block #6,827,135 · 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