Block #491,589

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 2:43:05 PM · Difficulty 10.6827 · 6,325,334 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
86bea0c097c91f4624dafba32f2dc37dff4de7490ab9837af2b18349e09c83b0

Height

#491,589

Difficulty

10.682749

Transactions

1

Size

831 B

Version

2

Bits

0aaec8a1

Nonce

194,381

Timestamp

4/14/2014, 2:43:05 PM

Confirmations

6,325,334

Merkle Root

500b19c80e3a7d4de9c9f03e2e80ffdace4a8ad4698a462cf14118c53a9d740f
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.316 × 10⁹⁰(91-digit number)
13166135120521154896…31192551565703721839
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.316 × 10⁹⁰(91-digit number)
13166135120521154896…31192551565703721839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.633 × 10⁹⁰(91-digit number)
26332270241042309792…62385103131407443679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.266 × 10⁹⁰(91-digit number)
52664540482084619584…24770206262814887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.053 × 10⁹¹(92-digit number)
10532908096416923916…49540412525629774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.106 × 10⁹¹(92-digit number)
21065816192833847833…99080825051259549439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.213 × 10⁹¹(92-digit number)
42131632385667695667…98161650102519098879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.426 × 10⁹¹(92-digit number)
84263264771335391334…96323300205038197759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.685 × 10⁹²(93-digit number)
16852652954267078266…92646600410076395519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.370 × 10⁹²(93-digit number)
33705305908534156533…85293200820152791039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.741 × 10⁹²(93-digit number)
67410611817068313067…70586401640305582079
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,779,425 XPM·at block #6,816,922 · 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