Block #461,546

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 7:37:10 PM · Difficulty 10.4143 · 6,355,236 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d9099afb52e15ac1c8f30ab518f7409240731fd59e0b3dd0639ee1e96f9f5cfb

Height

#461,546

Difficulty

10.414324

Transactions

4

Size

1.29 KB

Version

2

Bits

0a6a112b

Nonce

43,331

Timestamp

3/26/2014, 7:37:10 PM

Confirmations

6,355,236

Merkle Root

6fa6736c8a5b9e3080346fe1ee60d7a401c0dba7a3e71a817249376e77998c87
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.

5.260 × 10¹⁰¹(102-digit number)
52606415052297235488…23815248701210386559
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
5.260 × 10¹⁰¹(102-digit number)
52606415052297235488…23815248701210386559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.052 × 10¹⁰²(103-digit number)
10521283010459447097…47630497402420773119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.104 × 10¹⁰²(103-digit number)
21042566020918894195…95260994804841546239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.208 × 10¹⁰²(103-digit number)
42085132041837788390…90521989609683092479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.417 × 10¹⁰²(103-digit number)
84170264083675576781…81043979219366184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.683 × 10¹⁰³(104-digit number)
16834052816735115356…62087958438732369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.366 × 10¹⁰³(104-digit number)
33668105633470230712…24175916877464739839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.733 × 10¹⁰³(104-digit number)
67336211266940461425…48351833754929479679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.346 × 10¹⁰⁴(105-digit number)
13467242253388092285…96703667509858959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.693 × 10¹⁰⁴(105-digit number)
26934484506776184570…93407335019717918719
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,778,291 XPM·at block #6,816,781 · 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.
Privacy Policy·

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