Block #546,345

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/15/2014, 7:59:09 PM · Difficulty 10.9558 · 6,261,496 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8aab221ff2f25b86cfa757eac0e78424a3f0d6941826b2a7b229b01f9344c693

Height

#546,345

Difficulty

10.955813

Transactions

2

Size

594 B

Version

2

Bits

0af4b02f

Nonce

109,517,125

Timestamp

5/15/2014, 7:59:09 PM

Confirmations

6,261,496

Merkle Root

aa85b11ed434888f725251749e76990fa9eb1e726a8742e357f75c4cd6c5fea0
Transactions (2)
1 in → 1 out8.3300 XPM116 B
3 in → 1 out25.8900 XPM386 B
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.298 × 10⁹⁹(100-digit number)
12985122588869705199…93753703866744150399
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.298 × 10⁹⁹(100-digit number)
12985122588869705199…93753703866744150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.597 × 10⁹⁹(100-digit number)
25970245177739410398…87507407733488300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.194 × 10⁹⁹(100-digit number)
51940490355478820797…75014815466976601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.038 × 10¹⁰⁰(101-digit number)
10388098071095764159…50029630933953203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.077 × 10¹⁰⁰(101-digit number)
20776196142191528318…00059261867906406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.155 × 10¹⁰⁰(101-digit number)
41552392284383056637…00118523735812812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.310 × 10¹⁰⁰(101-digit number)
83104784568766113275…00237047471625625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.662 × 10¹⁰¹(102-digit number)
16620956913753222655…00474094943251251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.324 × 10¹⁰¹(102-digit number)
33241913827506445310…00948189886502502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.648 × 10¹⁰¹(102-digit number)
66483827655012890620…01896379773005004799
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,706,766 XPM·at block #6,807,840 · 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