1. #6,816,5401CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #344,103

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 2:27:10 AM · Difficulty 10.1897 · 6,472,438 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27d7ec279de88b8e702a063dc7feb0baee5da527e9a4053297f64b90d1e610fa

Height

#344,103

Difficulty

10.189689

Transactions

11

Size

5.10 KB

Version

2

Bits

0a308f75

Nonce

109,872

Timestamp

1/5/2014, 2:27:10 AM

Confirmations

6,472,438

Merkle Root

29ceb1445339cc3a2e5d1846026754e30cd1a663070460de55833a63770685c9
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.110 × 10⁹⁸(99-digit number)
71100894750477885635…74560448925237821439
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.110 × 10⁹⁸(99-digit number)
71100894750477885635…74560448925237821439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.422 × 10⁹⁹(100-digit number)
14220178950095577127…49120897850475642879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.844 × 10⁹⁹(100-digit number)
28440357900191154254…98241795700951285759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.688 × 10⁹⁹(100-digit number)
56880715800382308508…96483591401902571519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.137 × 10¹⁰⁰(101-digit number)
11376143160076461701…92967182803805143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.275 × 10¹⁰⁰(101-digit number)
22752286320152923403…85934365607610286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.550 × 10¹⁰⁰(101-digit number)
45504572640305846807…71868731215220572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.100 × 10¹⁰⁰(101-digit number)
91009145280611693614…43737462430441144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.820 × 10¹⁰¹(102-digit number)
18201829056122338722…87474924860882288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.640 × 10¹⁰¹(102-digit number)
36403658112244677445…74949849721764577279
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,776,456 XPM·at block #6,816,540 · 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