Block #774,905

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/19/2014, 1:45:30 AM · Difficulty 10.9821 · 6,039,111 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a3d83926a16ce38c668f3a6f7fee1d276a25735dcb95ace9f0a55692ffaa5f94

Height

#774,905

Difficulty

10.982105

Transactions

8

Size

7.46 KB

Version

2

Bits

0afb6b43

Nonce

136,007,952

Timestamp

10/19/2014, 1:45:30 AM

Confirmations

6,039,111

Merkle Root

cd2738283432d1c4713e3082eb97434456debd74afbc8eeba76034496de95c65
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.540 × 10⁹⁴(95-digit number)
25409092316387009038…92054932862711788799
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.540 × 10⁹⁴(95-digit number)
25409092316387009038…92054932862711788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.081 × 10⁹⁴(95-digit number)
50818184632774018077…84109865725423577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.016 × 10⁹⁵(96-digit number)
10163636926554803615…68219731450847155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.032 × 10⁹⁵(96-digit number)
20327273853109607230…36439462901694310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.065 × 10⁹⁵(96-digit number)
40654547706219214461…72878925803388620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.130 × 10⁹⁵(96-digit number)
81309095412438428923…45757851606777241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.626 × 10⁹⁶(97-digit number)
16261819082487685784…91515703213554483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.252 × 10⁹⁶(97-digit number)
32523638164975371569…83031406427108966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.504 × 10⁹⁶(97-digit number)
65047276329950743138…66062812854217932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.300 × 10⁹⁷(98-digit number)
13009455265990148627…32125625708435865599
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,212 XPM·at block #6,814,015 · 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