Block #431,115

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/5/2014, 11:34:50 PM · Difficulty 10.3431 · 6,375,604 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c32439be9006f7b389b315c2c7e24a28bca25583d2477a549c874bed8f49234d

Height

#431,115

Difficulty

10.343057

Transactions

2

Size

393 B

Version

2

Bits

0a57d290

Nonce

433,437

Timestamp

3/5/2014, 11:34:50 PM

Confirmations

6,375,604

Merkle Root

a23bbbf58521dd29d8cadb4335418aca116a74538d83834a4def9e1d948d0c13
Transactions (2)
1 in → 1 out9.3400 XPM110 B
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.386 × 10¹⁰⁰(101-digit number)
13863774663937419393…80954604089810084239
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.386 × 10¹⁰⁰(101-digit number)
13863774663937419393…80954604089810084239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.772 × 10¹⁰⁰(101-digit number)
27727549327874838786…61909208179620168479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.545 × 10¹⁰⁰(101-digit number)
55455098655749677573…23818416359240336959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.109 × 10¹⁰¹(102-digit number)
11091019731149935514…47636832718480673919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.218 × 10¹⁰¹(102-digit number)
22182039462299871029…95273665436961347839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.436 × 10¹⁰¹(102-digit number)
44364078924599742058…90547330873922695679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.872 × 10¹⁰¹(102-digit number)
88728157849199484117…81094661747845391359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.774 × 10¹⁰²(103-digit number)
17745631569839896823…62189323495690782719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.549 × 10¹⁰²(103-digit number)
35491263139679793647…24378646991381565439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.098 × 10¹⁰²(103-digit number)
70982526279359587294…48757293982763130879
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,697,851 XPM·at block #6,806,718 · 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