Block #551,714

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/19/2014, 12:12:05 AM · Difficulty 10.9624 · 6,259,291 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
80ba79a5ce0e33ff8e553dfdb107c36796aa18f5715eece69e9796fb611ef900

Height

#551,714

Difficulty

10.962437

Transactions

10

Size

2.59 KB

Version

2

Bits

0af6624c

Nonce

24,697,087

Timestamp

5/19/2014, 12:12:05 AM

Confirmations

6,259,291

Merkle Root

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

8.365 × 10⁹⁸(99-digit number)
83659371163291859042…71939104305833273599
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
8.365 × 10⁹⁸(99-digit number)
83659371163291859042…71939104305833273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.673 × 10⁹⁹(100-digit number)
16731874232658371808…43878208611666547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.346 × 10⁹⁹(100-digit number)
33463748465316743616…87756417223333094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.692 × 10⁹⁹(100-digit number)
66927496930633487233…75512834446666188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.338 × 10¹⁰⁰(101-digit number)
13385499386126697446…51025668893332377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.677 × 10¹⁰⁰(101-digit number)
26770998772253394893…02051337786664755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.354 × 10¹⁰⁰(101-digit number)
53541997544506789787…04102675573329510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.070 × 10¹⁰¹(102-digit number)
10708399508901357957…08205351146659020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.141 × 10¹⁰¹(102-digit number)
21416799017802715914…16410702293318041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.283 × 10¹⁰¹(102-digit number)
42833598035605431829…32821404586636083199
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,732,144 XPM·at block #6,811,004 · 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