Block #456,257

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 2:35:32 AM · Difficulty 10.4165 · 6,360,394 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de38860e442467fadde990e14d7061666bc4d86b8496dca5ee33480a06d0b07c

Height

#456,257

Difficulty

10.416507

Transactions

2

Size

858 B

Version

2

Bits

0a6aa02d

Nonce

967,407,754

Timestamp

3/23/2014, 2:35:32 AM

Confirmations

6,360,394

Merkle Root

643913f4fcce8864347191ea1f7665cbafe7b52138e9356a712be47ac3a223a8
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.544 × 10⁹³(94-digit number)
35441311543990038850…44668004638673396719
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.544 × 10⁹³(94-digit number)
35441311543990038850…44668004638673396719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.088 × 10⁹³(94-digit number)
70882623087980077700…89336009277346793439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.417 × 10⁹⁴(95-digit number)
14176524617596015540…78672018554693586879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.835 × 10⁹⁴(95-digit number)
28353049235192031080…57344037109387173759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.670 × 10⁹⁴(95-digit number)
56706098470384062160…14688074218774347519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.134 × 10⁹⁵(96-digit number)
11341219694076812432…29376148437548695039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.268 × 10⁹⁵(96-digit number)
22682439388153624864…58752296875097390079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.536 × 10⁹⁵(96-digit number)
45364878776307249728…17504593750194780159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.072 × 10⁹⁵(96-digit number)
90729757552614499456…35009187500389560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.814 × 10⁹⁶(97-digit number)
18145951510522899891…70018375000779120639
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,777,325 XPM·at block #6,816,650 · 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