Block #390,119

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 10:43:35 PM · Difficulty 10.4239 · 6,436,277 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84073b02237ec1fd9b4bea56719eafcf3cad103a2d1851cbe0d2cc9f724778af

Height

#390,119

Difficulty

10.423947

Transactions

1

Size

902 B

Version

2

Bits

0a6c87cc

Nonce

24,771

Timestamp

2/4/2014, 10:43:35 PM

Confirmations

6,436,277

Merkle Root

e719c6f1ab3bf81c52f43392d072123d085f80f31f83eeba65db0339a4b3eeff
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.751 × 10⁹⁸(99-digit number)
17517846507777836431…35887246911839155201
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.751 × 10⁹⁸(99-digit number)
17517846507777836431…35887246911839155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.503 × 10⁹⁸(99-digit number)
35035693015555672863…71774493823678310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.007 × 10⁹⁸(99-digit number)
70071386031111345727…43548987647356620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.401 × 10⁹⁹(100-digit number)
14014277206222269145…87097975294713241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.802 × 10⁹⁹(100-digit number)
28028554412444538291…74195950589426483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.605 × 10⁹⁹(100-digit number)
56057108824889076582…48391901178852966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.121 × 10¹⁰⁰(101-digit number)
11211421764977815316…96783802357705932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.242 × 10¹⁰⁰(101-digit number)
22422843529955630632…93567604715411865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.484 × 10¹⁰⁰(101-digit number)
44845687059911261265…87135209430823731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.969 × 10¹⁰⁰(101-digit number)
89691374119822522531…74270418861647462401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,855,307 XPM·at block #6,826,395 · 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