Block #433,719

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2014, 6:26:58 PM · Difficulty 10.3483 · 6,373,177 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e214e5b8191bc4b542da0d8d29f13abe3f2ae23613ca95b518b8e6ca78df465

Height

#433,719

Difficulty

10.348281

Transactions

7

Size

4.00 KB

Version

2

Bits

0a5928f2

Nonce

236,103

Timestamp

3/7/2014, 6:26:58 PM

Confirmations

6,373,177

Merkle Root

cae247ac792cc58a2b269998db42ffcfd9ce9bda549027ae1b847b3b9d256e98
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.533 × 10¹⁰³(104-digit number)
25335099696679291483…18692818500325191679
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.533 × 10¹⁰³(104-digit number)
25335099696679291483…18692818500325191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.067 × 10¹⁰³(104-digit number)
50670199393358582966…37385637000650383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.013 × 10¹⁰⁴(105-digit number)
10134039878671716593…74771274001300766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.026 × 10¹⁰⁴(105-digit number)
20268079757343433186…49542548002601533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.053 × 10¹⁰⁴(105-digit number)
40536159514686866372…99085096005203066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.107 × 10¹⁰⁴(105-digit number)
81072319029373732745…98170192010406133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.621 × 10¹⁰⁵(106-digit number)
16214463805874746549…96340384020812267519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.242 × 10¹⁰⁵(106-digit number)
32428927611749493098…92680768041624535039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.485 × 10¹⁰⁵(106-digit number)
64857855223498986196…85361536083249070079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.297 × 10¹⁰⁶(107-digit number)
12971571044699797239…70723072166498140159
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,699,277 XPM·at block #6,806,895 · 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