Block #461,981

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/27/2014, 3:21:21 AM · Difficulty 10.4107 · 6,354,328 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e04487377b19799af631341b0796a6571b237fc4d09b8898a03a22824111a5e

Height

#461,981

Difficulty

10.410728

Transactions

8

Size

1.82 KB

Version

2

Bits

0a69257d

Nonce

6,760,336

Timestamp

3/27/2014, 3:21:21 AM

Confirmations

6,354,328

Merkle Root

33a13ab8327077d5c9d8d8e38c6b14422c49abfc98682bf2e3b23750873b4b18
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.660 × 10⁹⁴(95-digit number)
16601102672403125098…84505762089987157249
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.660 × 10⁹⁴(95-digit number)
16601102672403125098…84505762089987157249
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.320 × 10⁹⁴(95-digit number)
33202205344806250196…69011524179974314499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.640 × 10⁹⁴(95-digit number)
66404410689612500392…38023048359948628999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.328 × 10⁹⁵(96-digit number)
13280882137922500078…76046096719897257999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.656 × 10⁹⁵(96-digit number)
26561764275845000156…52092193439794515999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.312 × 10⁹⁵(96-digit number)
53123528551690000313…04184386879589031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.062 × 10⁹⁶(97-digit number)
10624705710338000062…08368773759178063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.124 × 10⁹⁶(97-digit number)
21249411420676000125…16737547518356127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.249 × 10⁹⁶(97-digit number)
42498822841352000251…33475095036712255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.499 × 10⁹⁶(97-digit number)
84997645682704000502…66950190073424511999
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,774,592 XPM·at block #6,816,308 · 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