Block #348,626

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 9:56:02 PM · Difficulty 10.2629 · 6,465,192 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4790cee1bcff00a4b6f9ec6f46c299ae90399a7eb4dbfd2080ee613fc91c7cc7

Height

#348,626

Difficulty

10.262937

Transactions

13

Size

5.12 KB

Version

2

Bits

0a434fd3

Nonce

20,244

Timestamp

1/7/2014, 9:56:02 PM

Confirmations

6,465,192

Merkle Root

fe9de3d3da6f5b377df6759af2e28819a3e8af135f9410431de2d630e4cdd7f4
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.

3.526 × 10⁹⁷(98-digit number)
35266588313492078495…33476276356106493279
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
3.526 × 10⁹⁷(98-digit number)
35266588313492078495…33476276356106493279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.053 × 10⁹⁷(98-digit number)
70533176626984156990…66952552712212986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.410 × 10⁹⁸(99-digit number)
14106635325396831398…33905105424425973119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.821 × 10⁹⁸(99-digit number)
28213270650793662796…67810210848851946239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.642 × 10⁹⁸(99-digit number)
56426541301587325592…35620421697703892479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.128 × 10⁹⁹(100-digit number)
11285308260317465118…71240843395407784959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.257 × 10⁹⁹(100-digit number)
22570616520634930236…42481686790815569919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.514 × 10⁹⁹(100-digit number)
45141233041269860473…84963373581631139839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.028 × 10⁹⁹(100-digit number)
90282466082539720947…69926747163262279679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.805 × 10¹⁰⁰(101-digit number)
18056493216507944189…39853494326524559359
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,754,612 XPM·at block #6,813,817 · 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