1. #6,808,0802CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #360,342

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 9:57:41 AM · Difficulty 10.3901 · 6,447,739 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
36332c729051b3f1e1d33d10f19baccb4b7896d377b92e9ff4f9688a40d94cc1

Height

#360,342

Difficulty

10.390106

Transactions

10

Size

2.93 KB

Version

2

Bits

0a63ddfb

Nonce

277,674

Timestamp

1/15/2014, 9:57:41 AM

Confirmations

6,447,739

Merkle Root

f8b05b8a1442a8ce553b1feb87fe05e6b8e6bb9c18b16a84b6082b8c89f39e99
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.

7.897 × 10¹⁰¹(102-digit number)
78976506749576378170…29690588921457571199
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
7.897 × 10¹⁰¹(102-digit number)
78976506749576378170…29690588921457571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.579 × 10¹⁰²(103-digit number)
15795301349915275634…59381177842915142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.159 × 10¹⁰²(103-digit number)
31590602699830551268…18762355685830284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.318 × 10¹⁰²(103-digit number)
63181205399661102536…37524711371660569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.263 × 10¹⁰³(104-digit number)
12636241079932220507…75049422743321139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.527 × 10¹⁰³(104-digit number)
25272482159864441014…50098845486642278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.054 × 10¹⁰³(104-digit number)
50544964319728882029…00197690973284556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.010 × 10¹⁰⁴(105-digit number)
10108992863945776405…00395381946569113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.021 × 10¹⁰⁴(105-digit number)
20217985727891552811…00790763893138227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.043 × 10¹⁰⁴(105-digit number)
40435971455783105623…01581527786276454399
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,708,696 XPM·at block #6,808,080 · 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.

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