Block #2,663,323

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2018, 7:25:11 AM · Difficulty 11.6473 · 4,178,540 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
32cc6d46605ae5d8e5a78e11f4f2072d17c181d560c959b5dac4c760eb7ad008

Height

#2,663,323

Difficulty

11.647335

Transactions

2

Size

871 B

Version

2

Bits

0ba5b7b8

Nonce

1,385,328,941

Timestamp

5/16/2018, 7:25:11 AM

Confirmations

4,178,540

Merkle Root

14aff6ac1c2b6685a4f69bb13c8eacdaa9d0a512a6c87f354cddc83e6e3a7913
Transactions (2)
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.

4.909 × 10⁹⁷(98-digit number)
49094351386825610833…69969494577190993919
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
4.909 × 10⁹⁷(98-digit number)
49094351386825610833…69969494577190993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.818 × 10⁹⁷(98-digit number)
98188702773651221666…39938989154381987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.963 × 10⁹⁸(99-digit number)
19637740554730244333…79877978308763975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.927 × 10⁹⁸(99-digit number)
39275481109460488666…59755956617527951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.855 × 10⁹⁸(99-digit number)
78550962218920977333…19511913235055902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.571 × 10⁹⁹(100-digit number)
15710192443784195466…39023826470111805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.142 × 10⁹⁹(100-digit number)
31420384887568390933…78047652940223610879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.284 × 10⁹⁹(100-digit number)
62840769775136781866…56095305880447221759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.256 × 10¹⁰⁰(101-digit number)
12568153955027356373…12190611760894443519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.513 × 10¹⁰⁰(101-digit number)
25136307910054712746…24381223521788887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.027 × 10¹⁰⁰(101-digit number)
50272615820109425493…48762447043577774079
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,979,282 XPM·at block #6,841,862 · 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