Block #350,805

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 7:41:49 AM · Difficulty 10.2859 · 6,458,961 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a87236ff06663781ec0f348d65810ff4b84f48bc918572106609ca7943fc8bb

Height

#350,805

Difficulty

10.285911

Transactions

5

Size

1.08 KB

Version

2

Bits

0a49317a

Nonce

28,899

Timestamp

1/9/2014, 7:41:49 AM

Confirmations

6,458,961

Merkle Root

4d46e12e8c3f6f809ada2fda75e830ec2c414e428a8a263bbc6d82c16cab35c9
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.

6.540 × 10⁹⁹(100-digit number)
65407204248633587817…79438908491167161699
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
6.540 × 10⁹⁹(100-digit number)
65407204248633587817…79438908491167161699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.308 × 10¹⁰⁰(101-digit number)
13081440849726717563…58877816982334323399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.616 × 10¹⁰⁰(101-digit number)
26162881699453435126…17755633964668646799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.232 × 10¹⁰⁰(101-digit number)
52325763398906870253…35511267929337293599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.046 × 10¹⁰¹(102-digit number)
10465152679781374050…71022535858674587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.093 × 10¹⁰¹(102-digit number)
20930305359562748101…42045071717349174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.186 × 10¹⁰¹(102-digit number)
41860610719125496202…84090143434698348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.372 × 10¹⁰¹(102-digit number)
83721221438250992405…68180286869396697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.674 × 10¹⁰²(103-digit number)
16744244287650198481…36360573738793395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.348 × 10¹⁰²(103-digit number)
33488488575300396962…72721147477586790399
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,722,214 XPM·at block #6,809,765 · 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