Block #458,615

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 5:25:54 PM · Difficulty 10.4210 · 6,351,620 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1cbee8f5cd73b9c329ee71bbaf59be379741d497a1ad0508c59d534969ab7ef2

Height

#458,615

Difficulty

10.420986

Transactions

2

Size

433 B

Version

2

Bits

0a6bc5c2

Nonce

9,555

Timestamp

3/24/2014, 5:25:54 PM

Confirmations

6,351,620

Merkle Root

d4013944e30c374f737b4411d3e3ffed3e0197e472e2571335205c0677aa3461
Transactions (2)
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.

3.181 × 10⁹⁶(97-digit number)
31811364309123838491…01878196150129478399
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
3.181 × 10⁹⁶(97-digit number)
31811364309123838491…01878196150129478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.362 × 10⁹⁶(97-digit number)
63622728618247676982…03756392300258956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.272 × 10⁹⁷(98-digit number)
12724545723649535396…07512784600517913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.544 × 10⁹⁷(98-digit number)
25449091447299070792…15025569201035827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.089 × 10⁹⁷(98-digit number)
50898182894598141585…30051138402071654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.017 × 10⁹⁸(99-digit number)
10179636578919628317…60102276804143308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.035 × 10⁹⁸(99-digit number)
20359273157839256634…20204553608286617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.071 × 10⁹⁸(99-digit number)
40718546315678513268…40409107216573235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.143 × 10⁹⁸(99-digit number)
81437092631357026537…80818214433146470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.628 × 10⁹⁹(100-digit number)
16287418526271405307…61636428866292940799
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,725,957 XPM·at block #6,810,234 · 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