Block #428,191

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 9:51:09 PM · Difficulty 10.3484 · 6,379,940 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3601608e0a47b3a92f613dae157577230d18f65b2c4d646944f0b6243a5153bb

Height

#428,191

Difficulty

10.348396

Transactions

4

Size

1.69 KB

Version

2

Bits

0a593075

Nonce

3,092

Timestamp

3/3/2014, 9:51:09 PM

Confirmations

6,379,940

Merkle Root

2d6491eb429df23d7f8d52fb8806245535a9e2ff50ca13c11462e6da54038d5c
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.349 × 10¹⁰⁰(101-digit number)
33496414661706484289…42611408310239646721
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.349 × 10¹⁰⁰(101-digit number)
33496414661706484289…42611408310239646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.699 × 10¹⁰⁰(101-digit number)
66992829323412968579…85222816620479293441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.339 × 10¹⁰¹(102-digit number)
13398565864682593715…70445633240958586881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.679 × 10¹⁰¹(102-digit number)
26797131729365187431…40891266481917173761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.359 × 10¹⁰¹(102-digit number)
53594263458730374863…81782532963834347521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.071 × 10¹⁰²(103-digit number)
10718852691746074972…63565065927668695041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.143 × 10¹⁰²(103-digit number)
21437705383492149945…27130131855337390081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.287 × 10¹⁰²(103-digit number)
42875410766984299891…54260263710674780161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.575 × 10¹⁰²(103-digit number)
85750821533968599782…08520527421349560321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.715 × 10¹⁰³(104-digit number)
17150164306793719956…17041054842699120641
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,709,089 XPM·at block #6,808,130 · 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