Activity Stream

Filter
Sort By Time Show
Recent Recent Popular Popular Anytime Anytime Last 24 Hours Last 24 Hours Last 7 Days Last 7 Days Last 30 Days Last 30 Days All All Photos Photos Forum Forums
  • LucaBiondi's Avatar
    Today, 00:16
    LucaBiondi replied to a thread paq8px in Data Compression
    Ok thank you Mpais. It was just to know your opinion Luca
    2050 replies | 558731 view(s)
  • JamesWasil's Avatar
    Yesterday, 22:08
    I agree with you and bwt on that. It's great to have a prize, but if the people who win it will pay their programmers (or programmer) more than they paid you to create it in the first place...that's not going to encourage people and might be considered taking advantage of them instead. I'm not sure if it's too late to change it, but perhaps they could say that in addition to the prize, the creator with the winning submission gets a guaranteed percentage of revenue generated from the use of their algorithm, even if only up to a certain amount. Even with the bar raised up to 3% improvement over 0.25%, there would still be stronger encouragement for competition and developers if there were residual incentives to any amount. The large corporation(s) who stand to benefit from the results will no doubt make use of it to profit from it well, and it shouldn't be unreasonable for the winner of the contest (or if there are several winners, residuals / x submissions per category) to be able to enjoy some of those same benefits. That might be the only way to really guarantee that it will be worthwhile to all competitors, and it doesn't require the companies and hosts for this contest to put up any additional money out of pocket beyond the prize amount, since the additional percentages will be provided by the amount saved over profits for storage and data transmission later on.
    70 replies | 4959 view(s)
  • JamesWasil's Avatar
    Yesterday, 21:04
    Nope. You're an idiot to not know anything but how to make false claims, you need mental help and a one-armed straight-jacket. You're a piss poor troll. Stop polluting the compression forums with your bullshit. It doesn't amount to anything and only takes away from the value of what people come here for. And yeah buddy, I'm just going to say it: you're absolutely insane. You invented nothing. Hollywood owes you nothing, because you didn't do anything. You just make bogus claims all over the place and need medication. It's not my fault or anyone else's here that you're an idiot and the world failed you, and we're really tired of hearing about it on every single thread you interject and spam message you've sent to people unsolicited. There were no insults until now. If you want to make insults, I'll give you some tomato. I was being nice to you but no more. That's the consequences of your ad-hominem after I apologized for getting your name wrong. I take back my apology. There are no consequences for telling it like it is, so there you go.
    18 replies | 2347 view(s)
  • JamesWasil's Avatar
    Yesterday, 20:58
    Yeah, he copied things from other sites. Not original. He has big problems.
    18 replies | 2347 view(s)
  • Alexander Rhatushnyak's Avatar
    Yesterday, 20:23
    No, it's a publicly available compressor, a pre-competition baseline.
    70 replies | 4959 view(s)
  • compgt's Avatar
    Yesterday, 20:01
    You're an idiot to not know the consequences of your insults.
    18 replies | 2347 view(s)
  • algorithm's Avatar
    Yesterday, 19:26
    Filter and then LZ is a poor choice for compression of photographic images(maybe they gain some speed, but compression ratio is hurt). There are simply no patterns in photographic images. You try to compress noisy data. Also QLIC2 is very good. Either Alexander uses very good filters before compressing with FSE, or some kind of context modeling is used. BTW Is it considered a submission?
    70 replies | 4959 view(s)
  • mpais's Avatar
    Yesterday, 17:07
    mpais replied to a thread paq8px in Data Compression
    As usual your options are better than mine and you actually managed to take #2 spot. Are you going to submit it? Also, don't forget that, if cmix gets updated with these improvements, it will again significantly increase the distance to #1 spot (well, with a huge help from precomp, now with Preflate integrated).
    2050 replies | 558731 view(s)
  • mpais's Avatar
    Yesterday, 17:05
    mpais replied to a thread paq8px in Data Compression
    No, it would be a lot of work for not much gain, so, for me personally, it's low priority. Detection itself, if memory serves from when working on precomp, is finicky, since we'd need to rely on just a few bits to detect possible frames, and then need a way to validate them, which incurs decompressing them. Otherwise we'd be in same situation as now, where we don't check deflate or gif detections for proper validity, and then get transform fails. Honestly, the whole pre-processing stage in paq8 is a mess, one that I'm not looking forward to meddling in.
    2050 replies | 558731 view(s)
  • mpais's Avatar
    Yesterday, 17:02
    mpais replied to a thread paq8px in Data Compression
    Changes: - Pre-training now available for the LSTM, with a heavily-quantized model trained on english texts - LSTM prediction is now promoted to the second layer of the paq mixer - Activations functions are now available in AVX2
    2050 replies | 558731 view(s)
  • moisesmcardona's Avatar
    Yesterday, 16:15
    moisesmcardona replied to a thread paq8px in Data Compression
    Hmm, so now the AMD machine was faster! Of course, I tested now v190 while the previous results were from v189. Maybe the slowdown had to do with the amount of simultaneous tasks being run? Keep in mind I only had 50% of processes running (16 threads out of 32). However, now I noticed that the LSTM is producing different results on AMD and Intel (for the AVX2 SIMD). I'm not sure if this is intended or if it may be a bug. ------------------------------ AMD machine: SSE2 no LSTM: paq8px_v190.exe -1 -simd sse2 "H:\test rav1e 0.1.0 993950d q175-s0.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Highest SIMD vectorization support on this system: AVX2. Using SSE2 neural network and hashtable functions. Creating archive test rav1e 0.1.0 993950d q175-s0.log.paq8px190 in single file mode... Filename: H:\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18415 Time 45.42 sec, used 552 MB (579223768 bytes) of memory AMD SSE2 LSTM: paq8px_v190.exe -1l -simd sse2 "H:\test rav1e 0.1.0 993950d q175-s0.log" "H:\test rav1e 0.1.0 993950d q175-s0 lstm sse2.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Highest SIMD vectorization support on this system: AVX2. Using SSE2 neural network and hashtable functions. Creating archive H:\test rav1e 0.1.0 993950d q175-s0 lstm sse2.log in single file mode... Filename: H:\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18504 Time 302.81 sec, used 570 MB (598303097 bytes) of memory AMD AVX2 LSTM (non-native build): paq8px_v190.exe -1l -simd avx2 "H:\test rav1e 0.1.0 993950d q175-s0.log" "H:\test rav1e 0.1.0 993950d q175-s0 lstm avx2.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Creating archive H:\test rav1e 0.1.0 993950d q175-s0 lstm avx2.log in single file mode... Filename: H:\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18378 Time 151.14 sec, used 572 MB (600230729 bytes) of memory AMD AVX2 LSTM (native build) paq8px_v190_nativecpu.exe -1l -simd avx2 "H:\test rav1e 0.1.0 993950d q175-s0.log" "H:\test rav1e 0.1.0 993950d q175-s0 lstm avx2 native.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Creating archive H:\test rav1e 0.1.0 993950d q175-s0 lstm avx2 native.log in single file mode... Filename: H:\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18389 Time 128.81 sec, used 572 MB (600230750 bytes) of memory Intel SSE2 no LSTM: paq8px_v190.exe -1 -simd sse2 "C:\temp\test rav1e 0.1.0 993950d q175-s0.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Highest SIMD vectorization support on this system: AVX2. Using SSE2 neural network and hashtable functions. Creating archive test rav1e 0.1.0 993950d q175-s0.log.paq8px190 in single file mode... Filename: C:\temp\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18415 Time 72.22 sec, used 552 MB (579223788 bytes) of memory Intel SSE2 LSTM: paq8px_v190.exe -1l -simd sse2 "C:\temp\test rav1e 0.1.0 993950d q175-s0.log" "C:\temp\test rav1e 0.1.0 993950d q175-s0 lstm sse2 intel.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Highest SIMD vectorization support on this system: AVX2. Using SSE2 neural network and hashtable functions. Creating archive C:\temp\test rav1e 0.1.0 993950d q175-s0 lstm sse2 intel.log in single file mode... Filename: C:\temp\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18504 Time 556.58 sec, used 570 MB (598303150 bytes) of memory Intel AVX2 LSTM (non-native build): paq8px_v190.exe -1l -simd avx2 "C:\temp\test rav1e 0.1.0 993950d q175-s0.log" "C:\temp\test rav1e 0.1.0 993950d q175-s0 lstm avx2 intel.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Creating archive C:\temp\test rav1e 0.1.0 993950d q175-s0 lstm avx2 intel.log in single file mode... Filename: C:\temp\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18391 Time 293.94 sec, used 572 MB (600230782 bytes) of memory Intel AVX2 LSTM (native build): paq8px_v190_nativecpu.exe -1l -simd avx2 "C:\temp\test rav1e 0.1.0 993950d q175-s0.log" "C:\temp\test rav1e 0.1.0 993950d q175-s0 lstm avx2 intel native.log" paq8px archiver v190 (c) 2020, Matt Mahoney et al. Creating archive C:\temp\test rav1e 0.1.0 993950d q175-s0 lstm avx2 intel native.log in single file mode... Filename: C:\temp\test rav1e 0.1.0 993950d q175-s0.log (320157 bytes) Block segmentation: 0 | text | 320157 bytes ----------------------- Total input size : 320157 Total archive size : 18385 Time 253.36 sec, used 572 MB (600230803 bytes) of memory Note that the SSE2 LSTM result matches for both CPUs but not the AVX2 version, both for Native and Non-native architecture build.
    2050 replies | 558731 view(s)
  • suryakandau@yahoo.co.id's Avatar
    Yesterday, 16:10
    what about if the price give to the author but the certificate is for me ?? is it fair enough ??
    70 replies | 4959 view(s)
  • lz77's Avatar
    Yesterday, 12:05
    Do not forget that you must ask the author of the open source program for permission to use it. But why does the author need competitors? The author also wants to get a prize! :)
    70 replies | 4959 view(s)
  • Gotty's Avatar
    Yesterday, 08:58
    Gotty replied to a thread paq8px in Data Compression
    @moisesmcardona Could you please try to run a short test with a small file (like bib or book1) on your systems with memory setting -1 and simd setting (-simd sse2) where the systems are idle? Could you turn off any antivirus software in the meantime?
    2050 replies | 558731 view(s)
  • Sportman's Avatar
    Yesterday, 08:32
    Sportman replied to a thread zpaq updates in Data Compression
    Surprising! https://www.biorxiv.org/content/10.1101/2020.07.22.216242v2.full.pdf
    2533 replies | 1099769 view(s)
  • suryakandau@yahoo.co.id's Avatar
    Yesterday, 06:46
    I only doing research about hash function implementation on data compression and I think the bwt comment is right. The prize is to small compared to Google programmer salary. Btw Could you please make some tweaking on MCM and let me learn something about your tweaking ? Thank you
    70 replies | 4959 view(s)
  • hexagone's Avatar
    Yesterday, 05:53
    @suryakandau@yahoo.co.id There is no value in a tweaking contest of MCM for specific data. Why don't you try to write something by yourself ? @MS1 The API for test 4 has no parameter to initialize the (de)compressor for a specific category: int32_t CDECL encodeInit( void **cmprContext ); Also, optionally a function like int32_t CDECL dispose(void *cmprContext ); would allow the (de)compressor to free memory allocated during init.
    70 replies | 4959 view(s)
  • suryakandau@yahoo.co.id's Avatar
    Yesterday, 03:12
    Or maybe 0.25% better than original to get more participants ?
    70 replies | 4959 view(s)
  • suryakandau@yahoo.co.id's Avatar
    Yesterday, 03:06
    3% better compression than original is too hard for the participants and the prize too small compared to 3% better than original.. How about 0.5%-1% ? Maybe the participant can grow up to enter gdcc.
    70 replies | 4959 view(s)
  • Shelwien's Avatar
    Yesterday, 02:49
    > from gdcc notices thread, ms1 said do own work it means we can not combine open source. > it means we must to code from scratch. and it is appreciated only 3000 euros. No, Maxim (Ms1) simply doesn't want to keep testing MCM with minor changes, so now you need 3% better compression than original to get it accepted. Its really a troublesome point, because we can't really ask for fully independent implementations - we'd just not get any participants then. But accepting minor changes of open-source software also doesn't seem fair, so some compromise has to be made. > The problem is that there are too many categories. > If there were half as many, the prize would be 6000. I'd rather remove the 2nd place prize... speed categories are reasonable, and we had even more data types during discussion. In any case, this can't be changed at this point already. > An unique LZ77+Huffman can claim price only in Rapid Compression of english text... There's also blockwise test and "mixed" (kinda executables). Image test also can be made compatible by adding some filter, like http://www.radgametools.com/oodlelimage.htm
    70 replies | 4959 view(s)
  • hexagone's Avatar
    Yesterday, 01:56
    hexagone replied to a thread paq8px in Data Compression
    Looking at memory frequency and amount is not sufficient to draw a conclusion. The sizes of the intermediate L1, L2 & L3 caches can make a big difference. Has anyone ever measured what amount of time is spent waiting for memory during compression ?
    2050 replies | 558731 view(s)
  • Darek's Avatar
    Yesterday, 00:55
    Darek replied to a thread paq8px in Data Compression
    I think the same - memory isn't an issue. It's something in not AMD prper using AVX2 or other Intel favourise instructions. Of course if Ryzen got 3200MHz or 3600MHz memory it wil help but not a lot - maybe 5-10%. The major issue is in other place.
    2050 replies | 558731 view(s)
  • Gotty's Avatar
    Yesterday, 00:12
    Gotty replied to a thread zpaq updates in Data Compression
    Zpaq is used as a Kolmogorov complexity approximation tool in the following article: ​ Phylogeny of the COVID-19 Virus SARS-CoV-2 by Compression Data compression is used to analyze SARS-CoV-2. Who would have thought?
    2533 replies | 1099769 view(s)
  • moisesmcardona's Avatar
    Yesterday, 00:03
    moisesmcardona replied to a thread paq8px in Data Compression
    The laptop with the Intel i7-4700MQ runs 16GB DDR3 at 1666Mhz. The other laptop with the Intel i7-7700HQ runs 64GB DDR4 at 2400Mhz. The AMD machine is running the 128GB RAM at 2133Mhz. I personally don't think RAM is the issue, as the numbers on both Intel machines are very similar given their architecture and speed differences.
    2050 replies | 558731 view(s)
  • hexagone's Avatar
    11th August 2020, 23:59
    hexagone replied to a thread paq8px in Data Compression
    I would look at the memory specs. Typically memory is the bottleneck with this kind of software.
    2050 replies | 558731 view(s)
  • Darek's Avatar
    11th August 2020, 22:42
    Darek replied to a thread paq8px in Data Compression
    Theroretically Ryzen 9 3950x shuold be about 30-33% faster than i7-4770HQ... Looks like there are 2 times slowdown from hidden reason. Of course different builds runs different on different architectures but it's eally strange. I've checked other benchmarks for these CPUs (CPU-Z, Cinebench r11.5, Cinebench r15, Cinebench r20, Geekbench 4.0, Geekbench 5.0, Passmark, SisoftSandra Arithmetic, Userbench) and all these tests shows in average about 33% of single thread dominance of 3950x vs. 4770HQ... These must be: a) worst (really worst) case scenario for Ryzen or b) some compile/build implications
    2050 replies | 558731 view(s)
  • Dresdenboy's Avatar
    11th August 2020, 22:41
    He created that data compression site with sources and interesting articles. For the other thing - not everything is in one's own hands. I know a similar case.
    18 replies | 2347 view(s)
  • moisesmcardona's Avatar
    11th August 2020, 20:12
    moisesmcardona replied to a thread paq8px in Data Compression
    Ok, here's the results of the AMD 3950x CPU along with the previous ones from Intel. Took aprox. 200,000 seconds more on AMD than on Intel. NOTE: The real number is the CPU time, since that logs the time the process was using the CPU. Run time is the overall time it took for the process to run.
    2050 replies | 558731 view(s)
  • JamesWasil's Avatar
    11th August 2020, 20:07
    Oops, I thought your last name was Tomato not Tamayo. I must have misread. I apologize for getting your name wrong. As for the rest of it, professional help of some sort may be needed, but I doubt that a lawyer to sue the tech firms is what's required for that. I sure hope that compgt is a troll of sorts. Otherwise, this is a very sad thing.
    18 replies | 2347 view(s)
  • Sportman's Avatar
    11th August 2020, 20:01
    I see some forums hacked today, don't know if this forum need an update: Base Score: 9.8 CRITICAL https://nvd.nist.gov/vuln/detail/CVE-2019-16759 vBulletin 5.6.0, 5.6.1, 5.6.2 Security Patch: https://forum.vbulletin.com/forum/vbulletin-announcements/vbulletin-announcements_aa/4445227-vbulletin-5-6-0-5-6-1-5-6-2-security-patch
    55 replies | 8649 view(s)
  • bwt's Avatar
    11th August 2020, 18:07
    I think if we develop from the existing source code it is more efficient and participant can grow up
    70 replies | 4959 view(s)
  • bwt's Avatar
    11th August 2020, 18:02
    The main important thing You must have fresh idea to write it from scratch n improve for several months..
    70 replies | 4959 view(s)
  • lz77's Avatar
    11th August 2020, 17:31
    An unique LZ77+Huffman can claim price only in Rapid Compression of english text...
    70 replies | 4959 view(s)
  • algorithm's Avatar
    11th August 2020, 17:24
    The problem is that there are too many categories. If there were half as many, the prize would be 6000.
    70 replies | 4959 view(s)
  • bwt's Avatar
    11th August 2020, 15:27
    from gdcc notices thread, ms1 said do own work it means we can not combine open source. it means we must to code from scratch. and it is appreciated only 3000 euros.
    70 replies | 4959 view(s)
  • Shelwien's Avatar
    11th August 2020, 15:08
    Combining open-source preprocessors and coders hardly requires months of work. And on other hand, an unique new work could claim prizes in multiple categories.
    70 replies | 4959 view(s)
  • bwt's Avatar
    11th August 2020, 13:19
    Yes, for several months the programmer only appreciated only 3000 euro. It is so dramatic...
    70 replies | 4959 view(s)
  • lz77's Avatar
    11th August 2020, 12:59
    I think so too. An ordinary programmer in a Google office gets $10,000 per month. Not every programmer wants to write a custom program for several months...
    70 replies | 4959 view(s)
  • bwt's Avatar
    11th August 2020, 12:47
    I think that the participants is not much interest because the prize is small.
    70 replies | 4959 view(s)
  • Darek's Avatar
    11th August 2020, 11:31
    Darek replied to a thread paq8px in Data Compression
    @moisesmcardona - yes, it really strange that CPU with 150-160 points in Cinebench r15 (single) runs faster than 3950x which achieve about 200-210 pts in Cinebench. My scores of 4 corpuses - both versions -> with -r and w/o this option plus best of them. paq8px_v190 got 2'nd place in Silesia benchmark now! It loses to cmix v18 "only" 183KB.
    2050 replies | 558731 view(s)
  • compgt's Avatar
    11th August 2020, 10:58
    Hurling insults to my name now, attacking me personally when you can just have an open mind?... The corrupt people using my Hollywood billion$ for themselves it seems created that profile "Gerald Tamayo math wizard" in the news here in the Philippines, also a child math whiz kid?! who was good in calculating square roots of numbers, and who was begging on the streets for money. That's in the news in 2014 or 2015, though i think i saw it already earlier. This they did to discredit me when they found out i have an internet presence already via my "The Data Compression Guide" in 2008. I don't despise the whiz kid, of course, no offense to him; He was just being used by these corrupt people. This will make people who google "Gerald Tamayo" think and perplexed that i'm that square root kid. I am the "Gerald Tamayo" whiz kid by that name, but in the 1970s to the 80s, pioneering modern computing and quantum computing, and was prolific in composing songs for the Hollywood singers and bands and making the Hollywood blockbuster movies. These hardcore corrupt people will do everything to discredit me or destroy me, at the same time shamelessly partaking of my Hollywood and tech billion$. Yes, i made some "Knight Rider" episodes too and programmed its analog AIs, when i was Hollywood.
    18 replies | 2347 view(s)
  • Trench's Avatar
    11th August 2020, 06:35
    that page has multiple issues to deal with. It's hard enough to extract/convert text that is presented clearly in a picture let alone not clearly. If their is no money to be made or a passion for it no one will invest time in it. No one can even make a simple program to put together a jigsaw puzzle. Most programs that make panorama distort the image to a degree and not not handle pixel art that is obvious. It almost seems like everyone wants to make the same programs as the other since people like to make what the other did better than make something original. But I think if someone wants to try it then it takes time for a program to scan it many times with many color variations and curves to spot some letters at every square. The word "THE" is kind of clear on the maybe. the rest are smaller fonts which get blurred. Every assumed letter has to be adjusted to get proper results and stores and then compared with a dictionary to find a match. If the human eye can not detect a hint of a letter which not likely a computer will. Maybe the best algorithm would be to quickly flicker multiple color variation combination and have the computer try to detect every square to match with a letter. compare it with other letters that you know that are behind a papers and see if it gets some match. But in the end i dont see it done with your example. maybe a perfectly new paper. The details must be first increased which another program is required, the bumps on the paper dont help. If you have a secret message on that no one will get it ever. Art programs have more options to to distort images than make them better. lol
    2 replies | 96 view(s)
  • moisesmcardona's Avatar
    10th August 2020, 23:50
    moisesmcardona replied to a thread paq8px in Data Compression
    My CPUs are Intel i7-4700MQ and i7-7700HQ. Both finished faster than the AMD CPUs that are currently running. Here are some numbers: NOTE: Computer names are wrong because I swapped the HDD and I haven't renamed them. But you can see the CPU details there. Files being compressed are around 230MB, 24-bit TIFF files. Compressing using -9l.
    2050 replies | 558731 view(s)
  • JamesWasil's Avatar
    10th August 2020, 22:55
    Yes, Gerald Tomato will tell us that the newest Knight Rider was already done and voiced by him during the cold war in the Philippines and not by William Daniels, and that it was done during the 70's even though he never knew about it. Funny how that works. Speaking of Knight Rider though, you know KITT and KARR had to use a great deal of data compression to store data with limited space and for transmissions with signals and frequencies. I wonder why the show never mentioned that or tried to (the original 80's show or the horrible reboots that came later). I figure Huffman or LZ77 might have been worth a mention at least once when talking about a state of the art computer and car of the future, but none of the episodes ever did?
    18 replies | 2347 view(s)
  • Darek's Avatar
    10th August 2020, 22:30
    Darek replied to a thread paq8px in Data Compression
    I can test some file to compare Intel CPU to AMD. I'm wondering how much faster is 3950x than 8950HK.
    2050 replies | 558731 view(s)
  • moisesmcardona's Avatar
    10th August 2020, 21:45
    moisesmcardona replied to a thread paq8px in Data Compression
    The AMD tasks are still running. I'll post the CPU runtime once they finish. May take another day for the 3950x system and like 3 more days for the 1700 CPU.
    2050 replies | 558731 view(s)
  • Darek's Avatar
    10th August 2020, 21:33
    Darek replied to a thread paq8px in Data Compression
    Could you provide some numbers?
    2050 replies | 558731 view(s)
  • Stefan Atev's Avatar
    10th August 2020, 20:39
    Thanks, this will save me some digging. I don't need a ton of examples, even 1 or 2 examples are better than pretending that text or that random chunks of compiler-produced x64 is representative....
    48 replies | 3728 view(s)
  • JamesWasil's Avatar
    10th August 2020, 19:47
    I have often wondered about this. Let's suppose you have something ready for the world and ready for the market. Is it better to have a patent, a patent pending, or a copyright on it considering the semantic restrictions and red tape on works now for you to retain your rights to it?
    2 replies | 197 view(s)
  • Dresdenboy's Avatar
    10th August 2020, 18:14
    You might check the Hardcode collection (http://hardcode.untergrund.net/). It surely has some uncompressed intros >=1k and others might be decompressed by using some general unpacker or common tools (apack, upx) to decompress. Or use a debugger (which I did for a few). Beware of AV software warnings, though! ;)
    48 replies | 3728 view(s)
  • Shelwien's Avatar
    10th August 2020, 17:12
    Obviously extracting non-existent information is impossible. We can extrapolate from visible edges etc, but results would be frequently incorrect. https://www.3dnatives.com/en/photogrammetry-software-190920194/#!
    2 replies | 96 view(s)
  • Stefan Atev's Avatar
    10th August 2020, 16:51
    Hi, is there a place where I can find decompressed demos? I'd like to use real data when tweaking parameters / experimenting.
    48 replies | 3728 view(s)
  • Ms1's Avatar
    10th August 2020, 16:31
    We got submissions based on 3rd-party source code which perform marginally better (if at all) than the originals. I'd like to remind our conditions: http://globalcompetition.compression.ru/rules/#participant-requirements In particular: "Each participant guarantees that the submitted compressor or compressors are that participant’s own work or, if they’re based on third-party source code, they differ essentially from that code and the participant has received all necessary permissions to modify and submit the code to this competition. Each participant must also guarantee that the submitted compressor or compressors violate no third-party intellectual-property rights." The spirit of the condition is that your modifications should produce a different compressor which performs very different from the original, and you don't abuse intellectual property rights and copyrights of other people. We don't have any exact objective criteria what does "differ essentially" mean, our decisions on this are subjective, but, to give a rule of thumb, don't have any hope if the modified compressor shows compression ratio improvements which are worse than 3% for the same (or similar) speed in case of public parts of the tests. Do something your own, don't mechanically train and tune.
    5 replies | 1098 view(s)
  • moisesmcardona's Avatar
    10th August 2020, 15:55
    moisesmcardona replied to a thread paq8px in Data Compression
    Regarding the Intel vs AMD tests, the Intel CPUs are faster than the AMD. And here's this, I compiled it on my AMD Ryzen using NATIVECPU and the Intel machine was faster. Also, consider the fact that the Intel CPUs I have are all i7 mobile CPU parts (4c/8t) while the AMD Ryzen CPUs are all Desktop parts. So in conclusion: 1. Compiled PAQ8PX on my AMD machine using GCC with NATIVECPU 2. Ran PAQ8PX on Intel and AMD machines, which half threads used. 3. Intel tasks finished faster than the AMD tasks. Update: The first-gen Ryzen is half slower than the 3rd-gen. Mainly due to its AVX2 implementation being just 128-bit and requiring 2 cycles when the 3rd-gen supports 256-bit natively.
    2050 replies | 558731 view(s)
  • Dresdenboy's Avatar
    10th August 2020, 15:03
    Temisu (oneKpaq developer) also has collected a lot of depacker code (C++) here: https://github.com/temisu/ancient There are no small asm depackers, though, but at least the sources could give an idea of what could be implemented with small code footprint in asm. Another search revealed some more information and sources of baah's packer "louzy77" (the 32B depacker on 68000): http://abrobecker.free.fr/text/louzy.htm
    48 replies | 3728 view(s)
  • Trench's Avatar
    10th August 2020, 04:03
    It seems like many in the US don't know about that religion despite it was the first christian religion with the first churches and they put together the new testament bible but don't rely on it since Christ did not come to make the bible but apostolic succession to make the Church. The Catholic Churches pope goes directly against what Christ said that everyone is equal and no one above the other yet the pope is presented as above the rest. About every crusade was against the Orthodox church which stole a lot of thing which the previous pope said he was sorry for that but wont give anything bad which is a hollow apology. Which the Ottomans Turks saw their opportunity of a weakened county and invaded which helped the catholic church be the main power to preach. The protestant sects that spin off the Catholic church interoperates the bible as they see fit and as the world of God despite the Orthodox church has more resources than the bible and they also go against what Christ says since they have no apostolic succession and everyone has their own interest that present it and miss the point. No one is saved automatically to just believe and salvation come from doing the right thing. A sin means to miss the mark to fail and to love sin is to love failure, which is not right. To be better and not stagnate and rot. In short its something to make yourself better. A Christian majority nations are places that most in the world want to go to. When that does not exist every nation will be one big prison.
    0 replies | 50 view(s)
  • CompressMaster's Avatar
    10th August 2020, 01:07
    Maybe irrelevant question, but... It´s possible to see particular object behind another in image by using advanced algorithms? If not, what do you think in the near future, it would be possible some day? I´m just asking...
    2 replies | 96 view(s)
  • pacalovasjurijus's Avatar
    9th August 2020, 15:50
    We enjoy writing programs. We like writing programs.
    4 replies | 259 view(s)
  • Darek's Avatar
    9th August 2020, 11:13
    Darek replied to a thread paq8px in Data Compression
    Scores of my testset for paq8px_v190. Option -r gives some slight improvements to textual files.
    2050 replies | 558731 view(s)
  • danlock's Avatar
    9th August 2020, 06:52
    I wonder if it relates to the new Knight Rider series I heard was coming?
    18 replies | 2347 view(s)
  • danlock's Avatar
    9th August 2020, 06:00
    danlock replied to a thread 7zip update in Data Compression
    A small fix to 7-Zip 20.01 was posted. Source of following text: https://sourceforge.net/p/sevenzip/discussion/45797/thread/9dbfea1e30/ 7-Zip 20.02 alpha was released. 7-Zip for 64-bit Windows x64: https://7-zip.org/a/7z2002-x64.exe 7-Zip for 32-bit Windows: https://7-zip.org/a/7z2002.exe What's new after 7-Zip 20.00 alpha: Notes about changes in 7-Zip 20.02 size of solid block for 7z/LZMA2 archives was increased, so 7-Zip can use more threads and chunks to compress solid block. It can improve the compression speed for multi-core processors like Threadripper/Epyc and Xeon. Also it can slightly improve multi-core LZMA2 decompression speed. Some important parts of PPMd code were rewritten for faster compression and decompression. And that new PPMd code works faster for data that is not too compressible, like exe files or already compressed data. Also PPMD in previous 7-Zip could be slow in some Intel CPUs for decompression, if CVE-2018-3639 Speculative Store Bypass (SSB) mitigation was enabled in system. And new PPMd code must work faster for such cases too. Another change of 7-Zip 20.02 is speed optimization in Delta filter code, that is about two times faster than in previous version. 7-Zip testing You can post the results of tests to to show the changes between 7-Zip 20.00 and new 7-Zip 20.02. Notes: you can test any version of 7-Zip without full installation. You just need to extract exe installer of 7-Zip as archive file to any folder and run 7-zip from that folder. following command is a benchmark command that can show some changes of new version 20.02: 7z b -mmt=* -mm=* -bt > b.txt The only expected changes in benchmark results between 20.00 and 20.02 versions are PPMd and Delta lines. If you have CPU with big number of threads, you can compare 7z/LZMA2 compression speed for big data (more than 4 GB) with versions 20.00 and 20.02: 7z a mx1.7z files -bt -mx1 >> a.txt 7z t mx1.7z -bt >> a.txt 7z a mx5.7z files -bt -mx5 >> a.txt 7z t mx5.7z -bt >> a.txt 7-Zip 20.02 can be faster than 20.00, if your CPU has big number of threads. What's new after 7-Zip 20.01 alpha: the bug was fixed: 7-Zip File Manager 20.01 could lock archive files while 7-Zip File Manager is running.
    1 replies | 329 view(s)
  • pacalovasjurijus's Avatar
    8th August 2020, 14:14
    I like writing programs. c=0 while c < -1: c=c+1
    46 replies | 5440 view(s)
  • Dresdenboy's Avatar
    8th August 2020, 07:52
    Dresdenboy replied to a thread Crinkler in Data Compression
    Somewhat related: There is another, less known compressor for 1K/4K intros called oneKpaq (developed for Mac with clang compiler, but I could get it running on Win with some changes, at least providing compressed sizes), with a 128-165 byte decompressor code (not including executable file format headers, which are included in the Crinkler decompressor). Here's the repository: https://github.com/temisu/oneKpaq
    2 replies | 2855 view(s)
  • danlock's Avatar
    8th August 2020, 07:31
    danlock replied to a thread Crinkler in Data Compression
    As old as this thread is, I believe it is the correct place to put the notification that the popular demoscene executable compressor (compressing linker), Crinkler, has been made open-source: https://github.com/runestubbe/Crinkler I acknowledge that it's been several weeks and that Dresdenboy already posted about Crinkler's new status and linked to its Github repository in the '(Extremely) tiny decompressors' thread.
    2 replies | 2855 view(s)
  • avitar's Avatar
    7th August 2020, 20:13
    avitar started a thread 7zip update in Data Compression
    ​7-Zip 20.01 alpha was released.7-Zip for 64-bit Windows x64: https://7-zip.org/a/7z2001-x64.exe 7-Zip for 32-bit Windows: https://7-zip.org/a/7z2001.exe What's new after 7-Zip 20.00 alpha: The default number of LZMA2 chunks per solid block in 7z archive was increased to 64. It allows to increase the compression speed for big 7z archives, if there is a big number of CPU cores and threads. The speed of PPMd compressing/decompressing was increased for 7z/ZIP/RAR archives. The new -ssp switch. If the switch -ssp is specified, 7-Zip doesn't allow the system to modify "Last Access Time" property of source files for archiving and hashing operations. Some bugs were fixed. New localization: Swahili. See later update 2002 below!
    1 replies | 329 view(s)
  • ivan2k2's Avatar
    7th August 2020, 03:55
    MultiPar with subfolders
    1 replies | 88 view(s)
  • SvenBent's Avatar
    7th August 2020, 02:20
    I am backing up som family pictures and i want to fully utilize the DVD's capacity for dat sefty redudancy I remember par files used to be the to go for to handle this so i went and downloaded quickpar 0.9 However this program is only able to crate par files for files in a current directory and no sub or multiple directories Is there a tool better for this purpose and able to handle multiple levels in a folder structure ?
    1 replies | 88 view(s)
  • encode's Avatar
    6th August 2020, 19:41
    For comparison, i7-9700K @ 5.0 and 5.1 GHz:
    208 replies | 127180 view(s)
  • withmorten's Avatar
    6th August 2020, 16:57
    I actually found that a bit after and forgot to mention it, thanks for getting back though :) Nice IDA historical archive in any case, and via TOR the speed wasn't quite so bad.
    4 replies | 581 view(s)
  • LucaBiondi's Avatar
    6th August 2020, 14:48
    LucaBiondi replied to a thread paq8px in Data Compression
    Hi Mpais, what about a preliminare model for mp3 files? Do you think should be an easy task? Luca
    2050 replies | 558731 view(s)
More Activity