Block #338,150

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 6:08:51 AM · Difficulty 10.1182 · 6,478,547 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1231099b90294df3b81882db558ecf24ff0bcb2263e02634ed3e74763bd47965

Height

#338,150

Difficulty

10.118240

Transactions

8

Size

2.94 KB

Version

2

Bits

0a1e44fa

Nonce

546,452

Timestamp

1/1/2014, 6:08:51 AM

Confirmations

6,478,547

Merkle Root

dfbc055e79f3d231b6d41fea558dd206107ae3fbaa12a1f550643372ea15de50
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.

2.202 × 10⁹⁷(98-digit number)
22020860003367033636…89119457822604989999
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
2.202 × 10⁹⁷(98-digit number)
22020860003367033636…89119457822604989999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.404 × 10⁹⁷(98-digit number)
44041720006734067272…78238915645209979999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.808 × 10⁹⁷(98-digit number)
88083440013468134545…56477831290419959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.761 × 10⁹⁸(99-digit number)
17616688002693626909…12955662580839919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.523 × 10⁹⁸(99-digit number)
35233376005387253818…25911325161679839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.046 × 10⁹⁸(99-digit number)
70466752010774507636…51822650323359679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.409 × 10⁹⁹(100-digit number)
14093350402154901527…03645300646719359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.818 × 10⁹⁹(100-digit number)
28186700804309803054…07290601293438719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.637 × 10⁹⁹(100-digit number)
56373401608619606108…14581202586877439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.127 × 10¹⁰⁰(101-digit number)
11274680321723921221…29162405173754879999
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,777,698 XPM·at block #6,816,696 · 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