1. #6,806,575TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #338,070

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 4:23:16 AM · Difficulty 10.1226 · 6,468,506 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e6ac570d3f209c06972d0de78594812f4545109b1559d201da7603e52f89fca5

Height

#338,070

Difficulty

10.122604

Transactions

1

Size

1.01 KB

Version

2

Bits

0a1f6302

Nonce

272,213

Timestamp

1/1/2014, 4:23:16 AM

Confirmations

6,468,506

Merkle Root

18cc49ac4dd5d51f93be5b11f455f1742dd3065b367d29dcb21c9a30b453e0af
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.

1.670 × 10¹⁰⁰(101-digit number)
16702661760816199709…85708294878983054719
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
1.670 × 10¹⁰⁰(101-digit number)
16702661760816199709…85708294878983054719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.340 × 10¹⁰⁰(101-digit number)
33405323521632399418…71416589757966109439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.681 × 10¹⁰⁰(101-digit number)
66810647043264798837…42833179515932218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.336 × 10¹⁰¹(102-digit number)
13362129408652959767…85666359031864437759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.672 × 10¹⁰¹(102-digit number)
26724258817305919534…71332718063728875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.344 × 10¹⁰¹(102-digit number)
53448517634611839069…42665436127457751039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.068 × 10¹⁰²(103-digit number)
10689703526922367813…85330872254915502079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.137 × 10¹⁰²(103-digit number)
21379407053844735627…70661744509831004159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.275 × 10¹⁰²(103-digit number)
42758814107689471255…41323489019662008319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.551 × 10¹⁰²(103-digit number)
85517628215378942511…82646978039324016639
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,696,703 XPM·at block #6,806,575 · 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