Block #348,679

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 10:47:17 PM · Difficulty 10.2633 · 6,458,045 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
458602c68d278e7d59c0a95039e170a3b411637a095e04b59b0e76f6007713c2

Height

#348,679

Difficulty

10.263316

Transactions

15

Size

11.53 KB

Version

2

Bits

0a4368ae

Nonce

54,161

Timestamp

1/7/2014, 10:47:17 PM

Confirmations

6,458,045

Merkle Root

77aaaaf8677b0d11044842f5e908ab373cdb00470cf55abe3e2c11bd5c9e8362
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.370 × 10⁹⁸(99-digit number)
23703860621422719462…84893162290227763199
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.370 × 10⁹⁸(99-digit number)
23703860621422719462…84893162290227763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.740 × 10⁹⁸(99-digit number)
47407721242845438924…69786324580455526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.481 × 10⁹⁸(99-digit number)
94815442485690877849…39572649160911052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.896 × 10⁹⁹(100-digit number)
18963088497138175569…79145298321822105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.792 × 10⁹⁹(100-digit number)
37926176994276351139…58290596643644211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.585 × 10⁹⁹(100-digit number)
75852353988552702279…16581193287288422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.517 × 10¹⁰⁰(101-digit number)
15170470797710540455…33162386574576844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.034 × 10¹⁰⁰(101-digit number)
30340941595421080911…66324773149153689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.068 × 10¹⁰⁰(101-digit number)
60681883190842161823…32649546298307379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.213 × 10¹⁰¹(102-digit number)
12136376638168432364…65299092596614758399
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,889 XPM·at block #6,806,723 · 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