Block #461,157

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 12:50:58 PM · Difficulty 10.4159 · 6,348,894 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
778abe718efd95babad11d6dca006c554789156e6be1434ac457ccefd6c74905

Height

#461,157

Difficulty

10.415857

Transactions

5

Size

1.19 KB

Version

2

Bits

0a6a7596

Nonce

1,755,725,538

Timestamp

3/26/2014, 12:50:58 PM

Confirmations

6,348,894

Merkle Root

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

9.971 × 10⁹⁴(95-digit number)
99714128048971678142…49517425192402625619
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
9.971 × 10⁹⁴(95-digit number)
99714128048971678142…49517425192402625619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.994 × 10⁹⁵(96-digit number)
19942825609794335628…99034850384805251239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.988 × 10⁹⁵(96-digit number)
39885651219588671256…98069700769610502479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.977 × 10⁹⁵(96-digit number)
79771302439177342513…96139401539221004959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.595 × 10⁹⁶(97-digit number)
15954260487835468502…92278803078442009919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.190 × 10⁹⁶(97-digit number)
31908520975670937005…84557606156884019839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.381 × 10⁹⁶(97-digit number)
63817041951341874011…69115212313768039679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.276 × 10⁹⁷(98-digit number)
12763408390268374802…38230424627536079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.552 × 10⁹⁷(98-digit number)
25526816780536749604…76460849255072158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.105 × 10⁹⁷(98-digit number)
51053633561073499208…52921698510144317439
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,724,481 XPM·at block #6,810,050 · 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.

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