Block #433,310

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2014, 12:16:34 PM · Difficulty 10.3435 · 6,375,364 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b17c86d0e022e96c21ef9c860fc0f030111d9ecd1e0d47fe908b5db74facf037

Height

#433,310

Difficulty

10.343456

Transactions

6

Size

1.31 KB

Version

2

Bits

0a57ecb4

Nonce

128,047

Timestamp

3/7/2014, 12:16:34 PM

Confirmations

6,375,364

Merkle Root

3ddc7e5f044dcc085effc1754b9b7e7531f993005b3a1c815339391305839f2d
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.443 × 10¹⁰²(103-digit number)
14430900346362310062…71971354518530587839
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.443 × 10¹⁰²(103-digit number)
14430900346362310062…71971354518530587839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.886 × 10¹⁰²(103-digit number)
28861800692724620124…43942709037061175679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.772 × 10¹⁰²(103-digit number)
57723601385449240249…87885418074122351359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.154 × 10¹⁰³(104-digit number)
11544720277089848049…75770836148244702719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.308 × 10¹⁰³(104-digit number)
23089440554179696099…51541672296489405439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.617 × 10¹⁰³(104-digit number)
46178881108359392199…03083344592978810879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.235 × 10¹⁰³(104-digit number)
92357762216718784399…06166689185957621759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.847 × 10¹⁰⁴(105-digit number)
18471552443343756879…12333378371915243519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.694 × 10¹⁰⁴(105-digit number)
36943104886687513759…24666756743830487039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.388 × 10¹⁰⁴(105-digit number)
73886209773375027519…49333513487660974079
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,713,438 XPM·at block #6,808,673 · 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