Block #459,155

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2014, 3:01:33 AM · Difficulty 10.4172 · 6,351,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
98d3212c5e9d5b36c786b3937388f953ec505c4783d857e81fa9fbfea54e111c

Height

#459,155

Difficulty

10.417230

Transactions

10

Size

4.42 KB

Version

2

Bits

0a6acf9a

Nonce

41,316

Timestamp

3/25/2014, 3:01:33 AM

Confirmations

6,351,836

Merkle Root

a79f7401b1d47b5b080546582957a819bcba1ff1eca11d91bd08c3e896aedac1
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.619 × 10⁹⁹(100-digit number)
96195264411991440099…92929268082992114159
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.619 × 10⁹⁹(100-digit number)
96195264411991440099…92929268082992114159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.923 × 10¹⁰⁰(101-digit number)
19239052882398288019…85858536165984228319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.847 × 10¹⁰⁰(101-digit number)
38478105764796576039…71717072331968456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.695 × 10¹⁰⁰(101-digit number)
76956211529593152079…43434144663936913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.539 × 10¹⁰¹(102-digit number)
15391242305918630415…86868289327873826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.078 × 10¹⁰¹(102-digit number)
30782484611837260831…73736578655747653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.156 × 10¹⁰¹(102-digit number)
61564969223674521663…47473157311495306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.231 × 10¹⁰²(103-digit number)
12312993844734904332…94946314622990612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.462 × 10¹⁰²(103-digit number)
24625987689469808665…89892629245981224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.925 × 10¹⁰²(103-digit number)
49251975378939617330…79785258491962449919
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,732,032 XPM·at block #6,810,990 · 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