Block #533,548

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2014, 6:47:41 PM · Difficulty 10.9000 · 6,274,909 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5583e1f2bf719c6843c8400043112dd7881ad52a9019d2f730a720ab1078da64

Height

#533,548

Difficulty

10.899956

Transactions

6

Size

1.45 KB

Version

2

Bits

0ae66387

Nonce

32,049,597

Timestamp

5/9/2014, 6:47:41 PM

Confirmations

6,274,909

Merkle Root

bebf4f8a61dcb416ed2de7bd0b57902fcbd19822a902dc9f97e3665df32a904b
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.627 × 10⁹⁸(99-digit number)
16279439005153459880…03694184414513411919
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.627 × 10⁹⁸(99-digit number)
16279439005153459880…03694184414513411919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.255 × 10⁹⁸(99-digit number)
32558878010306919761…07388368829026823839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.511 × 10⁹⁸(99-digit number)
65117756020613839523…14776737658053647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.302 × 10⁹⁹(100-digit number)
13023551204122767904…29553475316107295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.604 × 10⁹⁹(100-digit number)
26047102408245535809…59106950632214590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.209 × 10⁹⁹(100-digit number)
52094204816491071618…18213901264429181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.041 × 10¹⁰⁰(101-digit number)
10418840963298214323…36427802528858362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.083 × 10¹⁰⁰(101-digit number)
20837681926596428647…72855605057716725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.167 × 10¹⁰⁰(101-digit number)
41675363853192857294…45711210115433451519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.335 × 10¹⁰⁰(101-digit number)
83350727706385714589…91422420230866903039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.667 × 10¹⁰¹(102-digit number)
16670145541277142917…82844840461733806079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,711,719 XPM·at block #6,808,456 · 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