Block #486,086

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2014, 10:10:52 AM · Difficulty 10.6189 · 6,331,859 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
98635795805f45244bc9317fd8396cf167675f51bf72815425e9d6b11bd28eba

Height

#486,086

Difficulty

10.618907

Transactions

7

Size

1.52 KB

Version

2

Bits

0a9e70b7

Nonce

76,789

Timestamp

4/11/2014, 10:10:52 AM

Confirmations

6,331,859

Merkle Root

1a0d16e318796c84d7a3a4ca50982408fedcf2111fddb367124429d712774a7b
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.

1.647 × 10⁹⁸(99-digit number)
16473193342728104307…80305728380080408429
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
1.647 × 10⁹⁸(99-digit number)
16473193342728104307…80305728380080408429
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.294 × 10⁹⁸(99-digit number)
32946386685456208614…60611456760160816859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.589 × 10⁹⁸(99-digit number)
65892773370912417229…21222913520321633719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.317 × 10⁹⁹(100-digit number)
13178554674182483445…42445827040643267439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.635 × 10⁹⁹(100-digit number)
26357109348364966891…84891654081286534879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.271 × 10⁹⁹(100-digit number)
52714218696729933783…69783308162573069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.054 × 10¹⁰⁰(101-digit number)
10542843739345986756…39566616325146139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.108 × 10¹⁰⁰(101-digit number)
21085687478691973513…79133232650292279039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.217 × 10¹⁰⁰(101-digit number)
42171374957383947026…58266465300584558079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.434 × 10¹⁰⁰(101-digit number)
84342749914767894053…16532930601169116159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.686 × 10¹⁰¹(102-digit number)
16868549982953578810…33065861202338232319
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,787,627 XPM·at block #6,817,944 · 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