Block #495,630

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 5:23:42 PM · Difficulty 10.7407 · 6,319,319 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a1ac82abe8b977235067dc6e4e652e7633225b38ed04a926b8e1af41724ffa9

Height

#495,630

Difficulty

10.740733

Transactions

8

Size

2.04 KB

Version

2

Bits

0abda0a6

Nonce

109,913,459

Timestamp

4/16/2014, 5:23:42 PM

Confirmations

6,319,319

Merkle Root

19e9830fa1a87c48c43aeebd347affdc9c34757fedb415e8f8538ef84741da07
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.

4.221 × 10⁹⁹(100-digit number)
42216342063274482479…19933339490277068799
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
4.221 × 10⁹⁹(100-digit number)
42216342063274482479…19933339490277068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.443 × 10⁹⁹(100-digit number)
84432684126548964959…39866678980554137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.688 × 10¹⁰⁰(101-digit number)
16886536825309792991…79733357961108275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.377 × 10¹⁰⁰(101-digit number)
33773073650619585983…59466715922216550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.754 × 10¹⁰⁰(101-digit number)
67546147301239171967…18933431844433100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.350 × 10¹⁰¹(102-digit number)
13509229460247834393…37866863688866201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.701 × 10¹⁰¹(102-digit number)
27018458920495668787…75733727377732403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.403 × 10¹⁰¹(102-digit number)
54036917840991337574…51467454755464806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.080 × 10¹⁰²(103-digit number)
10807383568198267514…02934909510929612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.161 × 10¹⁰²(103-digit number)
21614767136396535029…05869819021859225599
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,763,689 XPM·at block #6,814,948 · 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