Block #458,227

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 10:54:06 AM · Difficulty 10.4214 · 6,348,908 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1fa8994419e841067dd6365798ca3fc24614a215c9b01af6a8dd12791b9207c6

Height

#458,227

Difficulty

10.421371

Transactions

3

Size

24.30 KB

Version

2

Bits

0a6bdf00

Nonce

337,772

Timestamp

3/24/2014, 10:54:06 AM

Confirmations

6,348,908

Merkle Root

f9157ec76080173ac3fcde390058c1dd1a634742dc596078f37c5b9246dfe75a
Transactions (3)
1 in → 1 out9.4425 XPM110 B
73 in → 1 out23.1400 XPM10.57 KB
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.

2.965 × 10¹⁰⁵(106-digit number)
29655823315350342216…82533113647639787519
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
2.965 × 10¹⁰⁵(106-digit number)
29655823315350342216…82533113647639787519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.931 × 10¹⁰⁵(106-digit number)
59311646630700684432…65066227295279575039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.186 × 10¹⁰⁶(107-digit number)
11862329326140136886…30132454590559150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.372 × 10¹⁰⁶(107-digit number)
23724658652280273772…60264909181118300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.744 × 10¹⁰⁶(107-digit number)
47449317304560547545…20529818362236600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.489 × 10¹⁰⁶(107-digit number)
94898634609121095091…41059636724473200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.897 × 10¹⁰⁷(108-digit number)
18979726921824219018…82119273448946401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.795 × 10¹⁰⁷(108-digit number)
37959453843648438036…64238546897892802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.591 × 10¹⁰⁷(108-digit number)
75918907687296876073…28477093795785605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.518 × 10¹⁰⁸(109-digit number)
15183781537459375214…56954187591571210239
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,701,185 XPM·at block #6,807,134 · 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