Block #482,789

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2014, 4:54:19 PM · Difficulty 10.5511 · 6,335,134 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f114da9f7d148277b1e71b424b9adc44e84f6b4a629a5dc5babf20c446ab49bd

Height

#482,789

Difficulty

10.551064

Transactions

5

Size

1.37 KB

Version

2

Bits

0a8d1284

Nonce

2,046,903,251

Timestamp

4/9/2014, 4:54:19 PM

Confirmations

6,335,134

Merkle Root

6a2d9b72907dad29cf152b78ab9d533c118b6dbe4b5e438151a5db4c1a03e289
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.

6.093 × 10¹⁰²(103-digit number)
60936323523999028891…13035887962688639599
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
6.093 × 10¹⁰²(103-digit number)
60936323523999028891…13035887962688639599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.218 × 10¹⁰³(104-digit number)
12187264704799805778…26071775925377279199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.437 × 10¹⁰³(104-digit number)
24374529409599611556…52143551850754558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.874 × 10¹⁰³(104-digit number)
48749058819199223113…04287103701509116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.749 × 10¹⁰³(104-digit number)
97498117638398446226…08574207403018233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.949 × 10¹⁰⁴(105-digit number)
19499623527679689245…17148414806036467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.899 × 10¹⁰⁴(105-digit number)
38999247055359378490…34296829612072934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.799 × 10¹⁰⁴(105-digit number)
77998494110718756981…68593659224145868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.559 × 10¹⁰⁵(106-digit number)
15599698822143751396…37187318448291737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.119 × 10¹⁰⁵(106-digit number)
31199397644287502792…74374636896583475199
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,787,450 XPM·at block #6,817,922 · 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