Block #491,037

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 6:06:46 AM · Difficulty 10.6803 · 6,319,060 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1be64f9012fb4009d320ae84059d62d98507e382178909e8091ded76904e6cad

Height

#491,037

Difficulty

10.680316

Transactions

5

Size

1.36 KB

Version

2

Bits

0aae2938

Nonce

78,645

Timestamp

4/14/2014, 6:06:46 AM

Confirmations

6,319,060

Merkle Root

7c49f93366f840f8abd9806f8d56698ce0f4f0305af43d4d2a75f16a778afff4
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.034 × 10¹⁰¹(102-digit number)
10341522465925643989…55662664265007411199
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.034 × 10¹⁰¹(102-digit number)
10341522465925643989…55662664265007411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.068 × 10¹⁰¹(102-digit number)
20683044931851287978…11325328530014822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.136 × 10¹⁰¹(102-digit number)
41366089863702575957…22650657060029644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.273 × 10¹⁰¹(102-digit number)
82732179727405151914…45301314120059289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.654 × 10¹⁰²(103-digit number)
16546435945481030382…90602628240118579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.309 × 10¹⁰²(103-digit number)
33092871890962060765…81205256480237158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.618 × 10¹⁰²(103-digit number)
66185743781924121531…62410512960474316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.323 × 10¹⁰³(104-digit number)
13237148756384824306…24821025920948633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.647 × 10¹⁰³(104-digit number)
26474297512769648612…49642051841897267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.294 × 10¹⁰³(104-digit number)
52948595025539297225…99284103683794534399
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,724,851 XPM·at block #6,810,096 · 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