Block #348,370

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 6:17:09 PM · Difficulty 10.2575 · 6,467,583 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1fef9177d3891f3e3cbe73a04c6fbbaaac3fe4aebd747108f98bb93f205e2960

Height

#348,370

Difficulty

10.257486

Transactions

13

Size

6.19 KB

Version

2

Bits

0a41ea95

Nonce

90,910

Timestamp

1/7/2014, 6:17:09 PM

Confirmations

6,467,583

Merkle Root

29654eb01c06a155f33e97a9d3bea7762f4160372590a1ac12eeede94e2c7dda
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.940 × 10¹⁰⁰(101-digit number)
19401391952792642112…12801717295949653759
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.940 × 10¹⁰⁰(101-digit number)
19401391952792642112…12801717295949653759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.880 × 10¹⁰⁰(101-digit number)
38802783905585284225…25603434591899307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.760 × 10¹⁰⁰(101-digit number)
77605567811170568450…51206869183798615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.552 × 10¹⁰¹(102-digit number)
15521113562234113690…02413738367597230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.104 × 10¹⁰¹(102-digit number)
31042227124468227380…04827476735194460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.208 × 10¹⁰¹(102-digit number)
62084454248936454760…09654953470388920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.241 × 10¹⁰²(103-digit number)
12416890849787290952…19309906940777840639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.483 × 10¹⁰²(103-digit number)
24833781699574581904…38619813881555681279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.966 × 10¹⁰²(103-digit number)
49667563399149163808…77239627763111362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.933 × 10¹⁰²(103-digit number)
99335126798298327616…54479255526222725119
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,771,737 XPM·at block #6,815,952 · 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