Block #1,462,176

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/18/2016, 12:56:26 AM · Difficulty 10.7836 · 5,378,932 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
69432ea93a7c08271762343d2a51507c724d89101d57ea6df9ad9fbf1e3f770a

Height

#1,462,176

Difficulty

10.783567

Transactions

2

Size

3.02 KB

Version

2

Bits

0ac897d1

Nonce

294,843,486

Timestamp

2/18/2016, 12:56:26 AM

Confirmations

5,378,932

Merkle Root

f24e774fb3c52d6d7dcc284a20c760ef3545478b5785b5642dc86fb25d1d79c5
Transactions (2)
1 in → 1 out8.6200 XPM110 B
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.255 × 10⁹³(94-digit number)
52556918277949931601…08257193168377694829
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.255 × 10⁹³(94-digit number)
52556918277949931601…08257193168377694829
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.051 × 10⁹⁴(95-digit number)
10511383655589986320…16514386336755389659
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.102 × 10⁹⁴(95-digit number)
21022767311179972640…33028772673510779319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.204 × 10⁹⁴(95-digit number)
42045534622359945281…66057545347021558639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.409 × 10⁹⁴(95-digit number)
84091069244719890562…32115090694043117279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.681 × 10⁹⁵(96-digit number)
16818213848943978112…64230181388086234559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.363 × 10⁹⁵(96-digit number)
33636427697887956225…28460362776172469119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.727 × 10⁹⁵(96-digit number)
67272855395775912450…56920725552344938239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.345 × 10⁹⁶(97-digit number)
13454571079155182490…13841451104689876479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.690 × 10⁹⁶(97-digit number)
26909142158310364980…27682902209379752959
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,973,230 XPM·at block #6,841,107 · 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