Block #481,512

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2014, 10:39:30 PM · Difficulty 10.5337 · 6,326,858 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
70b51156461e68c3c90fd6e6d476ae9ee188c568ee7b83e7e35a13d26ff5ecac

Height

#481,512

Difficulty

10.533686

Transactions

2

Size

3.89 KB

Version

2

Bits

0a889fa3

Nonce

8,104,170

Timestamp

4/8/2014, 10:39:30 PM

Confirmations

6,326,858

Merkle Root

86e9f61bfb3ce7f185e47af6452bd0d6c8c7968b01f26b519397b5cbd527dca1
Transactions (2)
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.182 × 10⁹⁹(100-digit number)
11827247122515361174…59735675472112742399
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.182 × 10⁹⁹(100-digit number)
11827247122515361174…59735675472112742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.365 × 10⁹⁹(100-digit number)
23654494245030722348…19471350944225484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.730 × 10⁹⁹(100-digit number)
47308988490061444696…38942701888450969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.461 × 10⁹⁹(100-digit number)
94617976980122889393…77885403776901939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.892 × 10¹⁰⁰(101-digit number)
18923595396024577878…55770807553803878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.784 × 10¹⁰⁰(101-digit number)
37847190792049155757…11541615107607756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.569 × 10¹⁰⁰(101-digit number)
75694381584098311514…23083230215215513599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.513 × 10¹⁰¹(102-digit number)
15138876316819662302…46166460430431027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.027 × 10¹⁰¹(102-digit number)
30277752633639324605…92332920860862054399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.055 × 10¹⁰¹(102-digit number)
60555505267278649211…84665841721724108799
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,711,014 XPM·at block #6,808,369 · 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