Block #458,206

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 10:29:25 AM · Difficulty 10.4214 · 6,355,961 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a3cd5e70ca5fcfad573576862fa0584f65654cef65815a3bb7318669870902f

Height

#458,206

Difficulty

10.421360

Transactions

5

Size

1.88 KB

Version

2

Bits

0a6bde48

Nonce

8,514,051

Timestamp

3/24/2014, 10:29:25 AM

Confirmations

6,355,961

Merkle Root

64d76feea837141075c5523ecf8b2cfa55f73c0fa3218bbe89a13272958a717a
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.

4.006 × 10⁹⁶(97-digit number)
40068766098403805627…38021511938957611519
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
4.006 × 10⁹⁶(97-digit number)
40068766098403805627…38021511938957611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.013 × 10⁹⁶(97-digit number)
80137532196807611254…76043023877915223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.602 × 10⁹⁷(98-digit number)
16027506439361522250…52086047755830446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.205 × 10⁹⁷(98-digit number)
32055012878723044501…04172095511660892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.411 × 10⁹⁷(98-digit number)
64110025757446089003…08344191023321784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.282 × 10⁹⁸(99-digit number)
12822005151489217800…16688382046643568639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.564 × 10⁹⁸(99-digit number)
25644010302978435601…33376764093287137279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.128 × 10⁹⁸(99-digit number)
51288020605956871203…66753528186574274559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.025 × 10⁹⁹(100-digit number)
10257604121191374240…33507056373148549119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.051 × 10⁹⁹(100-digit number)
20515208242382748481…67014112746297098239
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,757,417 XPM·at block #6,814,166 · 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