Block #404,512

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/14/2014, 9:30:11 PM · Difficulty 10.4362 · 6,402,639 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a2949a1c68af5242fc951f92e00260ba4bdbf84d19e59a834a589a74b41c4a5c

Height

#404,512

Difficulty

10.436228

Transactions

4

Size

887 B

Version

2

Bits

0a6fac9d

Nonce

52,293

Timestamp

2/14/2014, 9:30:11 PM

Confirmations

6,402,639

Merkle Root

41d1357c50144069ae5d723fc7f2784cfcace251b9a3423fb5ee433705a21bdb
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.738 × 10⁹⁹(100-digit number)
17383927031775664906…66003792085028270079
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.738 × 10⁹⁹(100-digit number)
17383927031775664906…66003792085028270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.476 × 10⁹⁹(100-digit number)
34767854063551329812…32007584170056540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.953 × 10⁹⁹(100-digit number)
69535708127102659625…64015168340113080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.390 × 10¹⁰⁰(101-digit number)
13907141625420531925…28030336680226160639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.781 × 10¹⁰⁰(101-digit number)
27814283250841063850…56060673360452321279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.562 × 10¹⁰⁰(101-digit number)
55628566501682127700…12121346720904642559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.112 × 10¹⁰¹(102-digit number)
11125713300336425540…24242693441809285119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.225 × 10¹⁰¹(102-digit number)
22251426600672851080…48485386883618570239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.450 × 10¹⁰¹(102-digit number)
44502853201345702160…96970773767237140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.900 × 10¹⁰¹(102-digit number)
89005706402691404320…93941547534474280959
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,701,214 XPM·at block #6,807,150 · 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