Block #341,402

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 10:36:09 AM · Difficulty 10.1377 · 6,469,606 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d602b4fbe8a0dd209c590fcb3a2ffc02734c0e24c5d835a3093eb0bc38843194

Height

#341,402

Difficulty

10.137689

Transactions

4

Size

1.78 KB

Version

2

Bits

0a233f96

Nonce

739,766

Timestamp

1/3/2014, 10:36:09 AM

Confirmations

6,469,606

Merkle Root

2c77d2fd2f13f2cd13aa2ea1a76da34c1c4ec59de000322105c8975fa6c8cccf
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.768 × 10⁹⁸(99-digit number)
37680120269694325436…47503417689685098399
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.768 × 10⁹⁸(99-digit number)
37680120269694325436…47503417689685098399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.536 × 10⁹⁸(99-digit number)
75360240539388650873…95006835379370196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.507 × 10⁹⁹(100-digit number)
15072048107877730174…90013670758740393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.014 × 10⁹⁹(100-digit number)
30144096215755460349…80027341517480787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.028 × 10⁹⁹(100-digit number)
60288192431510920699…60054683034961574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.205 × 10¹⁰⁰(101-digit number)
12057638486302184139…20109366069923148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.411 × 10¹⁰⁰(101-digit number)
24115276972604368279…40218732139846297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.823 × 10¹⁰⁰(101-digit number)
48230553945208736559…80437464279692595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.646 × 10¹⁰⁰(101-digit number)
96461107890417473118…60874928559385190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.929 × 10¹⁰¹(102-digit number)
19292221578083494623…21749857118770380799
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,732,168 XPM·at block #6,811,007 · 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.

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