1. #6,806,6201CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #480,413

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2014, 7:18:12 AM · Difficulty 10.5165 · 6,326,208 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e5bddeb440f408f66d01514e1facc2b456966456cec808ef262457c3af5ff98e

Height

#480,413

Difficulty

10.516461

Transactions

11

Size

4.14 KB

Version

2

Bits

0a8436d1

Nonce

294,764,569

Timestamp

4/8/2014, 7:18:12 AM

Confirmations

6,326,208

Merkle Root

6f812d7ad9e5d1d7a443e4a11cbce07b79e3b777f6be5762f7e11aef42414c93
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.752 × 10⁹⁷(98-digit number)
27526213865132017348…48473200633471474359
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.752 × 10⁹⁷(98-digit number)
27526213865132017348…48473200633471474359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.505 × 10⁹⁷(98-digit number)
55052427730264034696…96946401266942948719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.101 × 10⁹⁸(99-digit number)
11010485546052806939…93892802533885897439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.202 × 10⁹⁸(99-digit number)
22020971092105613878…87785605067771794879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.404 × 10⁹⁸(99-digit number)
44041942184211227756…75571210135543589759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.808 × 10⁹⁸(99-digit number)
88083884368422455513…51142420271087179519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.761 × 10⁹⁹(100-digit number)
17616776873684491102…02284840542174359039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.523 × 10⁹⁹(100-digit number)
35233553747368982205…04569681084348718079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.046 × 10⁹⁹(100-digit number)
70467107494737964410…09139362168697436159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.409 × 10¹⁰⁰(101-digit number)
14093421498947592882…18278724337394872319
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,697,068 XPM·at block #6,806,620 · 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