Block #338,993

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 7:27:44 PM · Difficulty 10.1259 · 6,478,392 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
046094cd0921850662b034017d003446c6a738addbb0be206f704203327d2b56

Height

#338,993

Difficulty

10.125899

Transactions

20

Size

17.32 KB

Version

2

Bits

0a203af2

Nonce

17,854

Timestamp

1/1/2014, 7:27:44 PM

Confirmations

6,478,392

Merkle Root

38b667bb9b1bb549ec0817e5a62e89c60588559284f34bb13a82886158cc38c1
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.

8.121 × 10⁹⁹(100-digit number)
81217379514069999975…66216714297763201619
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
8.121 × 10⁹⁹(100-digit number)
81217379514069999975…66216714297763201619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.624 × 10¹⁰⁰(101-digit number)
16243475902813999995…32433428595526403239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.248 × 10¹⁰⁰(101-digit number)
32486951805627999990…64866857191052806479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.497 × 10¹⁰⁰(101-digit number)
64973903611255999980…29733714382105612959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.299 × 10¹⁰¹(102-digit number)
12994780722251199996…59467428764211225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.598 × 10¹⁰¹(102-digit number)
25989561444502399992…18934857528422451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.197 × 10¹⁰¹(102-digit number)
51979122889004799984…37869715056844903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.039 × 10¹⁰²(103-digit number)
10395824577800959996…75739430113689807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.079 × 10¹⁰²(103-digit number)
20791649155601919993…51478860227379614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.158 × 10¹⁰²(103-digit number)
41583298311203839987…02957720454759229439
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,783,122 XPM·at block #6,817,384 · 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