Block #468,328

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/31/2014, 10:34:54 AM · Difficulty 10.4314 · 6,345,684 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
36dbce0661838dfcae9e5db025f010a1d645775a92f422777f148668e14aa74d

Height

#468,328

Difficulty

10.431433

Transactions

3

Size

31.67 KB

Version

2

Bits

0a6e7264

Nonce

8,844

Timestamp

3/31/2014, 10:34:54 AM

Confirmations

6,345,684

Merkle Root

3e21f6f6ebddc07b4db1756a945a014fa4bddfebb0c63e85a60759a3a499d31f
Transactions (3)
1 in → 1 out9.5126 XPM109 B
9 in → 1 out2.5800 XPM1.35 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.

1.075 × 10⁹⁶(97-digit number)
10750900930548282427…03588859718786149499
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.075 × 10⁹⁶(97-digit number)
10750900930548282427…03588859718786149499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.150 × 10⁹⁶(97-digit number)
21501801861096564854…07177719437572298999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.300 × 10⁹⁶(97-digit number)
43003603722193129709…14355438875144597999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.600 × 10⁹⁶(97-digit number)
86007207444386259418…28710877750289195999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.720 × 10⁹⁷(98-digit number)
17201441488877251883…57421755500578391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.440 × 10⁹⁷(98-digit number)
34402882977754503767…14843511001156783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.880 × 10⁹⁷(98-digit number)
68805765955509007534…29687022002313567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.376 × 10⁹⁸(99-digit number)
13761153191101801506…59374044004627135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.752 × 10⁹⁸(99-digit number)
27522306382203603013…18748088009254271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.504 × 10⁹⁸(99-digit number)
55044612764407206027…37496176018508543999
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,756,179 XPM·at block #6,814,011 · 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