Block #342,369

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2014, 12:53:32 AM · Difficulty 10.1563 · 6,473,712 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c1e6240de7ea13396c429805f754050b89c923ab1f0bd8f43b4c55b8876c64ba

Height

#342,369

Difficulty

10.156291

Transactions

9

Size

6.35 KB

Version

2

Bits

0a2802a8

Nonce

290,670

Timestamp

1/4/2014, 12:53:32 AM

Confirmations

6,473,712

Merkle Root

47e4a6cea29ffc9e8f0f82ea0bbc5c60e647e53c42d9445598c8379dd40a3ef0
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.667 × 10⁹⁷(98-digit number)
16676495440071828083…38096352110226760799
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.667 × 10⁹⁷(98-digit number)
16676495440071828083…38096352110226760799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.335 × 10⁹⁷(98-digit number)
33352990880143656167…76192704220453521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.670 × 10⁹⁷(98-digit number)
66705981760287312335…52385408440907043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.334 × 10⁹⁸(99-digit number)
13341196352057462467…04770816881814086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.668 × 10⁹⁸(99-digit number)
26682392704114924934…09541633763628172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.336 × 10⁹⁸(99-digit number)
53364785408229849868…19083267527256345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.067 × 10⁹⁹(100-digit number)
10672957081645969973…38166535054512691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.134 × 10⁹⁹(100-digit number)
21345914163291939947…76333070109025382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.269 × 10⁹⁹(100-digit number)
42691828326583879894…52666140218050764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.538 × 10⁹⁹(100-digit number)
85383656653167759789…05332280436101529599
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,772,766 XPM·at block #6,816,080 · 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