Block #482,313

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2014, 10:25:25 AM · Difficulty 10.5428 · 6,334,566 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e1f8c30560e9573a9800cfe7c9090e308dd002c820410656ab5a1b646203141c

Height

#482,313

Difficulty

10.542817

Transactions

8

Size

2.42 KB

Version

2

Bits

0a8af606

Nonce

75,954

Timestamp

4/9/2014, 10:25:25 AM

Confirmations

6,334,566

Merkle Root

8e7d130138736d81cd008df1b82faec9032ad556ccb6df095141b38940fb9e84
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.

2.043 × 10⁹⁵(96-digit number)
20436988008740012717…77882965924583723519
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
2.043 × 10⁹⁵(96-digit number)
20436988008740012717…77882965924583723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.087 × 10⁹⁵(96-digit number)
40873976017480025434…55765931849167447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.174 × 10⁹⁵(96-digit number)
81747952034960050868…11531863698334894079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.634 × 10⁹⁶(97-digit number)
16349590406992010173…23063727396669788159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.269 × 10⁹⁶(97-digit number)
32699180813984020347…46127454793339576319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.539 × 10⁹⁶(97-digit number)
65398361627968040694…92254909586679152639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.307 × 10⁹⁷(98-digit number)
13079672325593608138…84509819173358305279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.615 × 10⁹⁷(98-digit number)
26159344651187216277…69019638346716610559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.231 × 10⁹⁷(98-digit number)
52318689302374432555…38039276693433221119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.046 × 10⁹⁸(99-digit number)
10463737860474886511…76078553386866442239
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,779,071 XPM·at block #6,816,878 · 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