1. #6,816,624TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

  2. #6,816,6232CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #74,774

1CCLength 9★☆☆☆☆

Cunningham Chain of the First Kind · Discovered 7/21/2013, 12:53:35 PM · Difficulty 8.9957 · 6,741,851 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
accf03768b68d3e5c68d119b40714ba1b943b7c5f198ee0df51e3e8e098e4257

Height

#74,774

Difficulty

8.995718

Transactions

1

Size

201 B

Version

2

Bits

08fee75a

Nonce

413

Timestamp

7/21/2013, 12:53:35 PM

Confirmations

6,741,851

Merkle Root

4e902d59a133defb077b5eeaff618d41c8155fe7c499d9127d84a802e643e14e
Transactions (1)
1 in → 1 out12.3400 XPM110 B
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.291 × 10⁹⁷(98-digit number)
52919981390110836276…24713482953459592439
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.291 × 10⁹⁷(98-digit number)
52919981390110836276…24713482953459592439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.058 × 10⁹⁸(99-digit number)
10583996278022167255…49426965906919184879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.116 × 10⁹⁸(99-digit number)
21167992556044334510…98853931813838369759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.233 × 10⁹⁸(99-digit number)
42335985112088669021…97707863627676739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.467 × 10⁹⁸(99-digit number)
84671970224177338042…95415727255353479039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.693 × 10⁹⁹(100-digit number)
16934394044835467608…90831454510706958079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.386 × 10⁹⁹(100-digit number)
33868788089670935217…81662909021413916159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.773 × 10⁹⁹(100-digit number)
67737576179341870434…63325818042827832319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.354 × 10¹⁰⁰(101-digit number)
13547515235868374086…26651636085655664639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 9 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
CommonChain length 9

Found in most blocks. The baseline for Primecoin's proof-of-work.

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,777,123 XPM·at block #6,816,624 · 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