1. #6,807,0732CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

  2. #6,807,072TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #285,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 11:59:37 AM · Difficulty 9.9842 · 6,521,655 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
196a0a63fc3f1401b9b8ae7c8c804b62d04ee8e12890b86d54036f7d4d833856

Height

#285,419

Difficulty

9.984242

Transactions

1

Size

1.08 KB

Version

2

Bits

09fbf74e

Nonce

165,306

Timestamp

11/30/2013, 11:59:37 AM

Confirmations

6,521,655

Merkle Root

0b1193663e69ca6f3237b45ec242900c6b87f46588c9abbf327448dfcb595228
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.

8.670 × 10⁹⁰(91-digit number)
86701259889962300996…89560767851719024799
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
8.670 × 10⁹⁰(91-digit number)
86701259889962300996…89560767851719024799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.734 × 10⁹¹(92-digit number)
17340251977992460199…79121535703438049599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.468 × 10⁹¹(92-digit number)
34680503955984920398…58243071406876099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.936 × 10⁹¹(92-digit number)
69361007911969840797…16486142813752198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.387 × 10⁹²(93-digit number)
13872201582393968159…32972285627504396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.774 × 10⁹²(93-digit number)
27744403164787936318…65944571255008793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.548 × 10⁹²(93-digit number)
55488806329575872637…31889142510017587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.109 × 10⁹³(94-digit number)
11097761265915174527…63778285020035174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.219 × 10⁹³(94-digit number)
22195522531830349055…27556570040070348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.439 × 10⁹³(94-digit number)
44391045063660698110…55113140080140697599
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,700,687 XPM·at block #6,807,073 · 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