Block #459,075

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2014, 1:22:29 AM · Difficulty 10.4195 · 6,348,894 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f4b442fc899ba5032dfed58bd8ae77c37eeebd7094fcba8caabae3c105c12013

Height

#459,075

Difficulty

10.419458

Transactions

6

Size

2.12 KB

Version

2

Bits

0a6b61a0

Nonce

19,576,164

Timestamp

3/25/2014, 1:22:29 AM

Confirmations

6,348,894

Merkle Root

613fe08c42bac2ed447898ae8d4e5f95ad761cfcc381cd7aa8529829485b5cb1
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.

1.334 × 10⁹⁴(95-digit number)
13345618583445274210…89867840474753543999
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
1.334 × 10⁹⁴(95-digit number)
13345618583445274210…89867840474753543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.669 × 10⁹⁴(95-digit number)
26691237166890548421…79735680949507087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.338 × 10⁹⁴(95-digit number)
53382474333781096843…59471361899014175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.067 × 10⁹⁵(96-digit number)
10676494866756219368…18942723798028351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.135 × 10⁹⁵(96-digit number)
21352989733512438737…37885447596056703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.270 × 10⁹⁵(96-digit number)
42705979467024877475…75770895192113407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.541 × 10⁹⁵(96-digit number)
85411958934049754950…51541790384226815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.708 × 10⁹⁶(97-digit number)
17082391786809950990…03083580768453631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.416 × 10⁹⁶(97-digit number)
34164783573619901980…06167161536907263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.832 × 10⁹⁶(97-digit number)
68329567147239803960…12334323073814527999
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,707,795 XPM·at block #6,807,968 · 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