Block #477,313

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/6/2014, 9:35:49 AM · Difficulty 10.4797 · 6,332,020 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee10f8fbd8f21e3553b87f841cce4d837ddf5363ca72ac5765c4f3504a4d12d2

Height

#477,313

Difficulty

10.479689

Transactions

8

Size

2.12 KB

Version

2

Bits

0a7acced

Nonce

287,431

Timestamp

4/6/2014, 9:35:49 AM

Confirmations

6,332,020

Merkle Root

d4801c8ad28f79acc3aebdd6e3b76a64b339b34a4836f1b668e086b495809b19
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.

6.346 × 10¹⁰⁰(101-digit number)
63460028122877510466…17453945461144616959
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
6.346 × 10¹⁰⁰(101-digit number)
63460028122877510466…17453945461144616959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.269 × 10¹⁰¹(102-digit number)
12692005624575502093…34907890922289233919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.538 × 10¹⁰¹(102-digit number)
25384011249151004186…69815781844578467839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.076 × 10¹⁰¹(102-digit number)
50768022498302008372…39631563689156935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.015 × 10¹⁰²(103-digit number)
10153604499660401674…79263127378313871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.030 × 10¹⁰²(103-digit number)
20307208999320803349…58526254756627742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.061 × 10¹⁰²(103-digit number)
40614417998641606698…17052509513255485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.122 × 10¹⁰²(103-digit number)
81228835997283213396…34105019026510970879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.624 × 10¹⁰³(104-digit number)
16245767199456642679…68210038053021941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.249 × 10¹⁰³(104-digit number)
32491534398913285358…36420076106043883519
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,718,730 XPM·at block #6,809,332 · 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