Block #467,095

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 1:43:22 PM · Difficulty 10.4336 · 6,350,211 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e0f056d5a22a6f9e2747fb1b3f89226c97ea99408c0aae8c1a25eef837403137

Height

#467,095

Difficulty

10.433590

Transactions

6

Size

1.51 KB

Version

2

Bits

0a6effc2

Nonce

9,750

Timestamp

3/30/2014, 1:43:22 PM

Confirmations

6,350,211

Merkle Root

f3301c2e6750f0a5ea2f74d3a0cc1639ac8ce5a30e7f30130a83dbb46960ce26
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.060 × 10¹⁰⁴(105-digit number)
10607066086060247776…17956225709135498239
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.060 × 10¹⁰⁴(105-digit number)
10607066086060247776…17956225709135498239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.121 × 10¹⁰⁴(105-digit number)
21214132172120495553…35912451418270996479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.242 × 10¹⁰⁴(105-digit number)
42428264344240991107…71824902836541992959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.485 × 10¹⁰⁴(105-digit number)
84856528688481982215…43649805673083985919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.697 × 10¹⁰⁵(106-digit number)
16971305737696396443…87299611346167971839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.394 × 10¹⁰⁵(106-digit number)
33942611475392792886…74599222692335943679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.788 × 10¹⁰⁵(106-digit number)
67885222950785585772…49198445384671887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.357 × 10¹⁰⁶(107-digit number)
13577044590157117154…98396890769343774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.715 × 10¹⁰⁶(107-digit number)
27154089180314234309…96793781538687549439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.430 × 10¹⁰⁶(107-digit number)
54308178360628468618…93587563077375098879
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,782,491 XPM·at block #6,817,305 · 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