Block #477,477

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/6/2014, 11:43:01 AM · Difficulty 10.4836 · 6,339,807 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f27213ebbd98ea9b5dcd0f3c87babfa8b2bc8cbad359c4dcd95144370d4cadc

Height

#477,477

Difficulty

10.483598

Transactions

1

Size

936 B

Version

2

Bits

0a7bcd0d

Nonce

10,003

Timestamp

4/6/2014, 11:43:01 AM

Confirmations

6,339,807

Merkle Root

fa23ea736aa7fa6147d42a0eec02cce930170636b4d297219f9815c616d5443c
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.935 × 10⁹⁸(99-digit number)
19359543511717722834…16753033696573194499
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.935 × 10⁹⁸(99-digit number)
19359543511717722834…16753033696573194499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.871 × 10⁹⁸(99-digit number)
38719087023435445668…33506067393146388999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.743 × 10⁹⁸(99-digit number)
77438174046870891336…67012134786292777999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.548 × 10⁹⁹(100-digit number)
15487634809374178267…34024269572585555999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.097 × 10⁹⁹(100-digit number)
30975269618748356534…68048539145171111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.195 × 10⁹⁹(100-digit number)
61950539237496713069…36097078290342223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.239 × 10¹⁰⁰(101-digit number)
12390107847499342613…72194156580684447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.478 × 10¹⁰⁰(101-digit number)
24780215694998685227…44388313161368895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.956 × 10¹⁰⁰(101-digit number)
49560431389997370455…88776626322737791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.912 × 10¹⁰⁰(101-digit number)
99120862779994740910…77553252645475583999
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,782,312 XPM·at block #6,817,283 · 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.
Privacy Policy·

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