Block #493,276

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 3:02:35 PM · Difficulty 10.6971 · 6,317,829 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f925553a41239e73648f5cec61e15051a7902cef771b00fd3198f47c87329101

Height

#493,276

Difficulty

10.697105

Transactions

2

Size

724 B

Version

2

Bits

0ab2757c

Nonce

75,000

Timestamp

4/15/2014, 3:02:35 PM

Confirmations

6,317,829

Merkle Root

78dea779ccfec07f8916860eca06563ddafe1e9e6c95647efe5c710602c14931
Transactions (2)
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.083 × 10¹⁰⁰(101-digit number)
10837027939500442269…36803200535399562239
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.083 × 10¹⁰⁰(101-digit number)
10837027939500442269…36803200535399562239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.167 × 10¹⁰⁰(101-digit number)
21674055879000884538…73606401070799124479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.334 × 10¹⁰⁰(101-digit number)
43348111758001769076…47212802141598248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.669 × 10¹⁰⁰(101-digit number)
86696223516003538152…94425604283196497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.733 × 10¹⁰¹(102-digit number)
17339244703200707630…88851208566392995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.467 × 10¹⁰¹(102-digit number)
34678489406401415260…77702417132785991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.935 × 10¹⁰¹(102-digit number)
69356978812802830521…55404834265571983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.387 × 10¹⁰²(103-digit number)
13871395762560566104…10809668531143966719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.774 × 10¹⁰²(103-digit number)
27742791525121132208…21619337062287933439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.548 × 10¹⁰²(103-digit number)
55485583050242264417…43238674124575866879
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,732,947 XPM·at block #6,811,104 · 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