Block #463,528

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/28/2014, 4:56:00 AM · Difficulty 10.4138 · 6,346,801 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
785f93611b6572446a2f8770bdc7b7c51c1a497cf69efcb2f3355b6df57ba483

Height

#463,528

Difficulty

10.413786

Transactions

3

Size

3.02 KB

Version

2

Bits

0a69ede1

Nonce

141,927

Timestamp

3/28/2014, 4:56:00 AM

Confirmations

6,346,801

Merkle Root

5343c35670a9fae33007712cc74b939209fd362f976faabce3ed5d7905536e12
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.

2.681 × 10¹⁰⁰(101-digit number)
26819656931445297514…53349312518191453399
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
2.681 × 10¹⁰⁰(101-digit number)
26819656931445297514…53349312518191453399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.363 × 10¹⁰⁰(101-digit number)
53639313862890595028…06698625036382906799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.072 × 10¹⁰¹(102-digit number)
10727862772578119005…13397250072765813599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.145 × 10¹⁰¹(102-digit number)
21455725545156238011…26794500145531627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.291 × 10¹⁰¹(102-digit number)
42911451090312476022…53589000291063254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.582 × 10¹⁰¹(102-digit number)
85822902180624952045…07178000582126508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.716 × 10¹⁰²(103-digit number)
17164580436124990409…14356001164253017599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.432 × 10¹⁰²(103-digit number)
34329160872249980818…28712002328506035199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.865 × 10¹⁰²(103-digit number)
68658321744499961636…57424004657012070399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.373 × 10¹⁰³(104-digit number)
13731664348899992327…14848009314024140799
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,726,712 XPM·at block #6,810,328 · 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