Block #465,643

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/29/2014, 2:32:28 PM · Difficulty 10.4255 · 6,360,471 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
000a2d17a40e86602e1d4372b144cde3828c9961aac02584aa97557593fd851c

Height

#465,643

Difficulty

10.425529

Transactions

2

Size

1.06 KB

Version

2

Bits

0a6cef73

Nonce

28,680

Timestamp

3/29/2014, 2:32:28 PM

Confirmations

6,360,471

Merkle Root

3e6287956233c8875ebe92bd600a292a2c078be6739b1f9f3d1e500741e546f0
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.

5.753 × 10⁹⁰(91-digit number)
57536997995919127303…66117400802120665599
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
5.753 × 10⁹⁰(91-digit number)
57536997995919127303…66117400802120665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.150 × 10⁹¹(92-digit number)
11507399599183825460…32234801604241331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.301 × 10⁹¹(92-digit number)
23014799198367650921…64469603208482662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.602 × 10⁹¹(92-digit number)
46029598396735301843…28939206416965324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.205 × 10⁹¹(92-digit number)
92059196793470603686…57878412833930649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.841 × 10⁹²(93-digit number)
18411839358694120737…15756825667861299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.682 × 10⁹²(93-digit number)
36823678717388241474…31513651335722598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.364 × 10⁹²(93-digit number)
73647357434776482948…63027302671445196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.472 × 10⁹³(94-digit number)
14729471486955296589…26054605342890393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.945 × 10⁹³(94-digit number)
29458942973910593179…52109210685780787199
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,853,037 XPM·at block #6,826,113 · 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