Block #468,320

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/31/2014, 10:28:14 AM · Difficulty 10.4315 · 6,349,170 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8f959fc21563211f04f6a978579c92e30c66cfe1c1ee08c524a07d1b0f67a10a

Height

#468,320

Difficulty

10.431474

Transactions

1

Size

1002 B

Version

2

Bits

0a6e7515

Nonce

3,305

Timestamp

3/31/2014, 10:28:14 AM

Confirmations

6,349,170

Merkle Root

b101f285d3f350da3d26a73c63e1b9381ba4c522867783d38a07a3397b58c5c0
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.232 × 10⁹³(94-digit number)
12329539634891426279…39091724340571829839
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.232 × 10⁹³(94-digit number)
12329539634891426279…39091724340571829839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.465 × 10⁹³(94-digit number)
24659079269782852559…78183448681143659679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.931 × 10⁹³(94-digit number)
49318158539565705119…56366897362287319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.863 × 10⁹³(94-digit number)
98636317079131410238…12733794724574638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.972 × 10⁹⁴(95-digit number)
19727263415826282047…25467589449149277439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.945 × 10⁹⁴(95-digit number)
39454526831652564095…50935178898298554879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.890 × 10⁹⁴(95-digit number)
78909053663305128190…01870357796597109759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.578 × 10⁹⁵(96-digit number)
15781810732661025638…03740715593194219519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.156 × 10⁹⁵(96-digit number)
31563621465322051276…07481431186388439039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.312 × 10⁹⁵(96-digit number)
63127242930644102552…14962862372776878079
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,783,967 XPM·at block #6,817,489 · 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