Block #343,286

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2014, 2:35:07 PM · Difficulty 10.1723 · 6,473,654 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
35a8469327e34a3adc38962908367e3a0b09b636a2f8e73a9f60fc5bb2e8b971

Height

#343,286

Difficulty

10.172262

Transactions

24

Size

7.44 KB

Version

2

Bits

0a2c1958

Nonce

5,496

Timestamp

1/4/2014, 2:35:07 PM

Confirmations

6,473,654

Merkle Root

a8238573a56e66c7a24a2db964ec399fbeeace69ac827207bcc9ecf516b0db29
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.011 × 10¹⁰³(104-digit number)
10118648355609114616…48526046041398202879
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.011 × 10¹⁰³(104-digit number)
10118648355609114616…48526046041398202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.023 × 10¹⁰³(104-digit number)
20237296711218229232…97052092082796405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.047 × 10¹⁰³(104-digit number)
40474593422436458464…94104184165592811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.094 × 10¹⁰³(104-digit number)
80949186844872916929…88208368331185623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.618 × 10¹⁰⁴(105-digit number)
16189837368974583385…76416736662371246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.237 × 10¹⁰⁴(105-digit number)
32379674737949166771…52833473324742492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.475 × 10¹⁰⁴(105-digit number)
64759349475898333543…05666946649484984319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.295 × 10¹⁰⁵(106-digit number)
12951869895179666708…11333893298969968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.590 × 10¹⁰⁵(106-digit number)
25903739790359333417…22667786597939937279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.180 × 10¹⁰⁵(106-digit number)
51807479580718666834…45335573195879874559
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,779,562 XPM·at block #6,816,939 · 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