Block #1,050,103

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2015, 8:19:23 AM · Difficulty 10.7277 · 5,775,193 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1c8bbb4460d27027860fc831d41acaf29e5e7235bfda6ded2c75db80dae44051

Height

#1,050,103

Difficulty

10.727687

Transactions

4

Size

882 B

Version

2

Bits

0aba49b0

Nonce

104,648,665

Timestamp

5/8/2015, 8:19:23 AM

Confirmations

5,775,193

Merkle Root

7bdefbe7e22058e7e8c45f70dfedda2c820290f35a7ea5c58b9386b3bbdd39ab
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.

5.732 × 10⁹³(94-digit number)
57327367460707311517…81372518661869941759
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
5.732 × 10⁹³(94-digit number)
57327367460707311517…81372518661869941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.146 × 10⁹⁴(95-digit number)
11465473492141462303…62745037323739883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.293 × 10⁹⁴(95-digit number)
22930946984282924607…25490074647479767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.586 × 10⁹⁴(95-digit number)
45861893968565849214…50980149294959534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.172 × 10⁹⁴(95-digit number)
91723787937131698428…01960298589919068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.834 × 10⁹⁵(96-digit number)
18344757587426339685…03920597179838136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.668 × 10⁹⁵(96-digit number)
36689515174852679371…07841194359676272639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.337 × 10⁹⁵(96-digit number)
73379030349705358742…15682388719352545279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.467 × 10⁹⁶(97-digit number)
14675806069941071748…31364777438705090559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.935 × 10⁹⁶(97-digit number)
29351612139882143496…62729554877410181119
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,846,468 XPM·at block #6,825,295 · 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