Block #527,776

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/6/2014, 6:33:58 AM · Difficulty 10.8844 · 6,283,203 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
40af0ada592c4425d4b5f763c3d529892ac1eccc882dcb76d0672508c40cc9e5

Height

#527,776

Difficulty

10.884420

Transactions

4

Size

885 B

Version

2

Bits

0ae2695e

Nonce

13,362,985

Timestamp

5/6/2014, 6:33:58 AM

Confirmations

6,283,203

Merkle Root

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

4.301 × 10⁹⁹(100-digit number)
43011254093160527539…08076786900715590399
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
4.301 × 10⁹⁹(100-digit number)
43011254093160527539…08076786900715590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.602 × 10⁹⁹(100-digit number)
86022508186321055079…16153573801431180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.720 × 10¹⁰⁰(101-digit number)
17204501637264211015…32307147602862361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.440 × 10¹⁰⁰(101-digit number)
34409003274528422031…64614295205724723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.881 × 10¹⁰⁰(101-digit number)
68818006549056844063…29228590411449446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.376 × 10¹⁰¹(102-digit number)
13763601309811368812…58457180822898892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.752 × 10¹⁰¹(102-digit number)
27527202619622737625…16914361645797785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.505 × 10¹⁰¹(102-digit number)
55054405239245475251…33828723291595571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.101 × 10¹⁰²(103-digit number)
11010881047849095050…67657446583191142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.202 × 10¹⁰²(103-digit number)
22021762095698190100…35314893166382284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.404 × 10¹⁰²(103-digit number)
44043524191396380200…70629786332764569599
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,731,935 XPM·at block #6,810,978 · 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